Sums of cubes and more - MathOverflow

Sums of cubes and more

2009-10-13T19:52:05Z

It's well-known that every natural number can be written as a sum of 4 squares of integers.

Has there been any recent progress about the similar problem for the cubes, 4-th powers and so on? I believe this was proven to be representable using some N — that depends on the power — and what's the story about it?

Answer by Noah Snyder for Sums of cubes and more

2009-10-13T19:56:38Z

This is called "Waring's problem."

Answer by David Zureick-Brown for Sums of cubes and more

2009-10-13T19:57:48Z

Yes! This is a classical problem with a lot of history. From Wikipedia:

In number theory, Waring's problem, proposed in 1770 by Edward Waring, asks whether for every natural number k there exists an associated positive integer s such that every natural number is the sum of at most s kth powers of natural numbers (for example, every number is the sum of at most 4 squares, or 9 cubes, or 19 fourth powers, etc.). The affirmative answer, known as the Hilbert–Waring theorem, was provided by Hilbert in 1909.[1] Waring's problem has its own Mathematics Subject Classification, 11P05, "Waring's problem and variants."

Answer by Kevin Lin for Sums of cubes and more

2009-10-13T20:01:07Z

I don't know, but I attended a talk by John Conway on this sort of stuff at Berkeley last year. Unfortunately I didn't take notes, but below is the abstract from the talk.

Nearly Universal Quadric Forms

I’m rather proud of having proved the “Fifteen Theorem,” according to which one can check that a positive definite quadratic form with integral matrix represents all positive integers provided only that it represents those up to 15. I’m almost as proud of having made the “290 Conjecture,” now proved by Bhargava and Hanke, that performs the similar service for integer valued forms. Why? – because together these two theorems end more than 200 years of work on universal quadratic forms, the first theorem in that subject being Lagrange’s 1770 Four Squares Theorem.

It’s now time to try to do the same for near-universality of three-dimensional forms, which subject was begun by Legendre’s much subtler Three Squares Theorem of 1798.

Answer by Alon Amit for Sums of cubes and more

2009-10-13T22:35:36Z

Arguably, the problem "what is the least g=g(k) such that every integer can be written as the sum of g k-th powers" is less interesting than the version that ignores the random stuff that's happening with a finite number of special cases.

Namely, the "real" question should be "what is the least G=G(k) such that for some N, every integer greater than N can be represented as the sum of G k-th powers".

For example, every number is the sum of 19 4th powers, but every number greater than 13,792 is actually the sum of just 16 4th powers. The "16" was known for quite some time; the verification that 13,792 is the last offender is quite recent (I found the value on Wikipedia, btw).

Evaluating G(k) is harder than evaluating g(k), and most of the actual values are still not known. I don't think there was tremendous recent progress on this front, although there certainly is progress on things like bounds, number of representations, etc.

You should look at Wooley's survey here (I haven't read it yet).