Erdős problem 1063

Estimate $n_k$ by finding a better upper bound.

Sources

The source's own material, retained exactly.

6 retained statements36c6d0fef71a

FormalConjectures/ErdosProblems/

1063.lean

Retained formal statement2 of 6

Cambie observed the improved bound $n_k \le k \cdot \operatorname{lcm}(1, \dotsc, k - 1)$ .

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

1∀ {k : ℕ}, 3 ≤ k → Erdos1063.n k ≤ k * (Finset.Icc 1 (k - 1)).lcm id

SolvedStatement only, no proof