Erdős problem 323
Is it true that for all ?
Sources
FormalConjectures/ErdosProblems/
323.lean
Retained formal statement
Is it true that for all ?
This would have significant applications to Waring's problem. Erdős and Graham describe this as 'unattackable by the methods at our disposal'.
True ↔ ∀ k ≥ 1, ∀ ε > 0, (fun x => ↑x ^ (1 - ε)) =O[Filter.atTop] fun x => ↑(Erdos323.f k k x)OpenStatement only, no proof