Erdős problem 688 · problems.science

Erdős claims in [Er80] (p. 106) that it is not difficult to prove $\epsilon_n \gg \frac{\log\log\log n}{\log\log n}$ .

Sources

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

4 retained statements2415f78e850a

FormalConjectures/ErdosProblems/

688.lean

Retained formal statement3 of 4

In particular, is it true that $\epsilon_n = o(1)$ ?

FormalConjectures/ErdosProblems/688.leanErdos688.erdos_688.parts.ii1 lineExact file

1True ↔ Erdos688.epsilonFunction =o[Filter.atTop] fun n => 1

OpenStatement only, no proof