Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

What types of proof are there of this result and where can I read about it?

I think that the Hardy-Littlewood circle method can prove that every number is the sum of something like $100000$ cubes, and you can use tables to prove those "small" numbers are all expressible as sums of cubes.. which gives you warings problem but I was more interested in specific proof about the cubes.

Dickson showed that the only integers requiring nine cubes are $23$ and $239$. Wieferich proved that only $15$ integers require eight cubes: $15, 22, 50, 114, 167, 175, 186, 212, 231, 238, 303, 364, 420, 428,$ and $454$ from mathworld

share|cite|improve this question
It is known that every sufficiently large number is a sum of 7 cubes, and conjectured that 4 cubes will do. – Gerry Myerson Oct 25 '12 at 22:18
actually I would like to know about cubes of integers too,but I think that problem has less known about it. – sperners lemma Oct 25 '12 at 22:23
239 needs 9 cubes – i. m. soloveichik Oct 26 '12 at 0:40
up vote 6 down vote accepted

There is a paper by L E Dickson, Simpler proofs of Waring's Theorem on cubes, with various generalizations, from the Transactions of the American Mathematical Society for 1928, available here. But you may be disappointed --- "Simpler" doesn't mean "simple".

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.