In the mathematics of sums of powers, it is an open problem to characterize the numbers that can be expressed as a sum of three cubes of integers, allowing both positive and negative cubes in the sum. A necessary condition for an integer n {\displaystyle n} to equal such a sum is that n {\displaystyle n} cannot equal 4 or 5 modulo 9, because the cubes modulo 9 are 0, 1, and −1, and no three of these numbers can sum to 4 or 5 modulo 9. It is unknown whether this necessary condition is sufficient. Variations of the problem include sums of non-negative cubes and sums of rational cubes. All integers have a representation as a sum of rational cubes, but it is unknown whether the sums of non-negative cubes form a set with non-zero natural density.
Small cases A nontrivial representation of 0 as a sum of three cubes would give a counterexample to Fermat's Last Theorem for the exponent three, as one of the three cubes would have the opposite sign as the other two and its negation would equal the sum of the other two. Therefore, by Leonhard Euler's proof of that case of Fermat's last theorem, there are only the trivial solutions
a 3 + ( − a ) 3 + 0 3 = 0. {\displaystyle a^{3}+(-a)^{3}+0^{3}=0.}
For representations of 1 and 2, there are infinite families of solutions
( 9 b 4 ) 3 + ( 3 b − 9 b 4 ) 3 + ( 1 − 9 b 3 ) 3 = 1 {\displaystyle (9b^{4})^{3}+(3b-9b^{4})^{3}+(1-9b^{3})^{3}=1} (discovered by K. Mahler in 1936) and
( 1 + 6 c 3 ) 3 + ( 1 − 6 c 3 ) 3 + ( − 6 c 2 ) 3 = 2 {\displaystyle (1+6c^{3})^{3}+(1-6c^{3})^{3}+(-6c^{2})^{3}=2} (discovered by A.S. Verebrusov in 1908, quoted by L.J. Mordell). These can be scaled to obtain representations for any cube or any number that is twice a cube. There are also other known representations of 2 that are not given by these infinite families:
1 214 928 3 + 3 480 205 3 + ( − 3 528 875 ) 3 = 2 , {\displaystyle 1\ 214\ 928^{3}+3\ 480\ 205^{3}+(-3\ 528\ 875)^{3}=2,}
37 404 275 617 3 + ( − 25 282 289 375 ) 3 + ( − 33 071 554 596 ) 3 = 2 , {\displaystyle 37\ 404\ 275\ 617^{3}+(-25\ 282\ 289\ 375)^{3}+(-33\ 071\ 554\ 596)^{3}=2,}
3 737 830 626 090 3 + 1 490 220 318 001 3 + ( − 3 815 176 160 999 ) 3 = 2. {\displaystyle 3\ 737\ 830\ 626\ 090^{3}+1\ 490\ 220\ 318\ 001^{3}+(-3\ 815\ 176\ 160\ 999)^{3}=2.}
However, 1 and 2 are the only numbers with representations that can be parameterized by quartic polynomials as above. Even in the case of representations of 3, Louis J. Mordell wrote in 1953 "I do not know anything" more than its small solutions
1 3 + 1 3 + 1 3 = 4 3 + 4 3 + ( − 5 ) 3 = 3 {\displaystyle 1^{3}+1^{3}+1^{3}=4^{3}+4^{3}+(-5)^{3}=3}
and the fact that each of the three cubed numbers must be equal modulo 9.
Computational results Since 1955, and starting with the instigation of Mordell, many authors have implemented computational searches for these representations. Elsenhans & Jahnel (2009) used a method of Noam Elkies (2000) involving lattice reduction to search for all solutions to the Diophantine equation
… excerpt ends here. Continue reading the full article.


