Waring's problem Updated +Created
And when it can't, attempt to classify which subset of the integers can be reached. E.g. Legendre's three-square theorem.
Waring's problem for squares Updated +Created
4 squares are sufficient by Lagrange's four-square theorem.
The subsets reachable with 2 and 3 squares are fully characterized by Legendre's three-square theorem and