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
For , the best known is due to Wooley [Wo15] [Wo15] Wooley, Trevor D., Sums of three cubes, II. Acta Arith. (2015), 73-100.
(fun x => ↑x ^ 0.917) =O[Filter.atTop] fun x => ↑(Erdos325.cardIsSumThreePowerBelow 3 x)SolvedStatement only, no proof