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

Open selected source

FormalConjectures/ErdosProblems/

1063.lean

Retained formal statement1 of 6

Estimate $n_k$ by finding a better upper bound.

FormalConjectures/ErdosProblems/1063.leanErdos1063.erdos_1063.better_upper3 linesExact file

1have upper_bound := sorry;2(fun k => ↑(Erdos1063.n k)) =O[Filter.atTop] upper_bound ∧3  upper_bound =o[Filter.atTop] fun k => ↑k * (Finset.Icc 1 (k - 1)).lcm fun n => ↑n

OpenStatement only, no proof

Sources

Search problems.science