Erdős problem 1063 · problems.science

Estimate $n_k$ by finding a better upper bound.

Sources

Browse retained paths and inspect the exact material available for this Problem.

6 retained statements2415f78e850a

FormalConjectures/ErdosProblems/

1063.lean

Retained formal statement6 of 6

The initial values satisfy $n_2 = 4$ , $n_3 = 6$ , $n_4 = 9$ , and $n_5 = 12$ ([Gu04], Problem B31).

FormalConjectures/ErdosProblems/1063.leanErdos1063.erdos_1063.variants.small_values1 lineExact file

1Erdos1063.n 2 = 4 ∧ Erdos1063.n 3 = 6 ∧ Erdos1063.n 4 = 9 ∧ Erdos1063.n 5 = 12

SolvedStatement only, no proof