Erdős problem 325
Writing for the number of integers which are the sum of three th powers, is it true that ?
Sources
FormalConjectures/ErdosProblems/
325.lean
Retained formal statement
Writing for the number of integers which are the sum of three th powers, is it even true that ?
True ↔ ∀ ε > 0, ∀ (k : ℕ), 3 ≤ k → (fun x => ↑x ^ (3 / ↑k - ε)) =O[Filter.atTop] fun x => ↑(Erdos325.cardIsSumThreePowerBelow k x)OpenStatement only, no proof