Sum of four cubes problem
 | This article needs additional citations for verification. (April 2022) (Learn how and when to remove this template message) |
 |
Unsolved problem in mathematics: Is every integer the sum of four perfect cubes? (more unsolved problems in mathematics)
|
The sum of four cubes problem[1] asks whether every integer is the sum of four cubes of integers. It is conjectured the answer is affirmative, but this conjecture has been neither proven nor disproven.[2] Some of the cubes may be negative numbers, in contrast to Waring's problem on sums of cubes, where they are required to be positive.
Partial results
The substitutions [math]\displaystyle{ X = T }[/math], [math]\displaystyle{ Y = T }[/math], and [math]\displaystyle{ Z = - T + 1 }[/math] in the identity [math]\displaystyle{ (X + Y + Z)^{3} - X^{3} - Y^{3} - Z^{3} = 3 (X + Y) (X + Z) (Y + Z) }[/math] lead to the identity [math]\displaystyle{ (T + 1)^{3} + (- T)^{3} + (- T)^{3} + (T - 1)^{3} = 6 T , }[/math] which shows that every integer multiple of 6 is the sum of four cubes. (More generally, the same proof shows that every multiple of 6 in every ring is the sum of four cubes.)
Since every integer is congruent to its own cube modulo 6, it follows that every integer is the sum of five cubes of integers.
In 1966, V. A. Demjanenko (de) proved that any integer that is congruent neither to 4 nor to −4 modulo 9 is the sum of four cubes of integers. For this, he used the following identities: [math]\displaystyle{ 6x = (x+1)^{3}+(x-1)^{3}-x^{3}-x^{3}, }[/math] [math]\displaystyle{ 6x+3 = x^3+(-x+4)^3+(2x-5)^3+(-2x+4)^3, }[/math] [math]\displaystyle{ 18x+1 = (2x+14)^3+(-2x-23)^3+(-3x-26)^3+(3x+30)^3, }[/math] [math]\displaystyle{ 18x+7 = (x+2)^3+(6x-1)^3+(8x-2)^3+(-9x+2)^3, }[/math] and [math]\displaystyle{ 18x+8 = (x-5)^3+(-x+14)^3+(-3x+29)^3+(3x-30)^3. }[/math] These identities (and those derived from them by passing to opposites) immediately show that any integer which is congruent neither to 4 nor to −4 modulo 9 and is congruent neither to 2 nor to −2 modulo 18 is a sum of four cubes of integers. Using more subtle reasonings, Demjanenko proved that integers congruent to 2 or to −2 modulo 18 are also sums of four cubes of integers.[3]
The problem therefore only arises for integers congruent to 4 or to −4 modulo 9. One example is [math]\displaystyle{ 13 = 10^3 + 7^3 + 1^3 + (-11)^3, }[/math] but it is not known if every such integer can be written as a sum of four cubes.
18x±2 case
According to Henri Cohen's translation of Demjanenko's paper, these identities [math]\displaystyle{ 54x + 2 = (29484x^{2} + 2211x + 43)^{3} + (-29484x^{2} - 2157x - 41)^{3} + (9828x^{2} + 485x + 4)^{3} + (-9828x^{2} - 971x - 22)^{3} }[/math][math]\displaystyle{ 54x + 20 = (3x - 11)^{3} + (-3x + 10)^{3} + (x + 2)^{3} + (-x + 7)^{3} }[/math][math]\displaystyle{ 216x - 16 = (14742x^{2} - 2157x + 82)^{3} + (-14742x^{2} + 2211x - 86)^{3} + (4914x^{2} - 971x + 44)^{3} + (-4914x^{2} + 485x - 8)^{3} }[/math][math]\displaystyle{ 216x + 92 = (3x - 164)^{3} + (-3x + 160)^{3} + (x - 35)^{3} + (-x + 71)^{3} }[/math] together with their complementary identities leave the 108x±38 case, proving the proposition. He also proves the 108x±38 case in his paper.
See also
Notes and references
- ↑ Referred to as the "four cube problem" in H. Davenport, The Higher Arithmetic: An Introduction to the Theory of Numbers, Cambridge University Press, 7th edition, 1999, p. 173, 177.
- ↑ At least in 1982. See Philippe Revoy, “Sur les sommes de quatre cubes”, L’Enseignement Mathématique, t. 29, 1983, p. 209-220, online here or here, p. 209 on the point in question.
- ↑ V.A. Demjanenko, "On sums of four cubes", Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, vol. 54, no. 5, 1966, p. 63-69, available online at the site Math-Net.Ru. For a demonstration in French, see Philippe Revoy, “Sur les sommes de quatre cubes”, L’Enseignement Mathématique, t. 29, 1983, p. 209-220, online here or here.
 |  |
