Erdős problem 920
Is it true that, for , for some constant ?
Sources
FormalConjectures/ErdosProblems/
920.lean
Retained formal statement
Is it true that, for , for some constant ?
This problem follows immediately from Mattheus and Verstraete's lower bound [MaVe23] for k = 4 and Bradač's lower bound [Br26] for k ≥ 5.
True ↔ ∀ k ≥ 4, ∃ c > 0, (fun n => ↑n ^ (1 - 1 / (↑k - 1)) / Real.log ↑n ^ c) =O[Filter.atTop] fun n => ↑(Erdos920.f k n)SolvedStatement only, no proof