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 to equal such a sum is that 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.[1] 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 casesedit
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,[2] there are only the trivial solutions
For representations of 1 and 2, there are infinite families of solutions
(discovered[4] by A.S. Verebrusov in 1908, quoted by L.J. Mordell[5]).
These can be scaled to obtain representations for any cube or any number that is twice a cube.[5] There are also other known representations of 2 that are not given by these infinite families:[6]
However, 1 and 2 are the only numbers with representations that can be parameterized by quartic polynomials as above.[5]
Even in the case of representations of 3, Louis J. Mordell wrote in 1953 "I do not know anything" more than its small solutions
and the fact that each of the three cubed numbers must be equal modulo 9.[7][8]
for positive at most 1000 and for ,[16] leaving only 33, 42, 74, 114, 165, 390, 579, 627, 633, 732, 795, 906, 921, and 975 as open problems in 2009 for , and 192, 375, and 600 remain with no primitive solutions (i.e. ). After Timothy Browning covered the problem on Numberphile in 2016, Huisman (2016) extended these searches to solving the case of 74, with solution
Through these searches, it was discovered that all that are unequal to 4 or 5 modulo 9 have a solution, with at most two exceptions, 33 and 42.[17]
However, in 2019, Andrew Booker settled the case by discovering that
In order to achieve this, Booker exploited an alternative search strategy with running time proportional to rather than to their maximum,[18] an approach originally suggested by Heath-Brown et al.[19] He also found that
and established that there are no solutions for or any of the other unresolved with .
Shortly thereafter, in September 2019, Booker and Andrew Sutherland finally settled the case, using 1.3 million hours of computing on the Charity Engine global grid to discover that
as well as solutions for several other previously unknown cases including and for .[20]
Booker and Sutherland also found a third representation of 3 using a further 4 million compute-hours on Charity Engine:
This discovery settled a 65-year old question of Louis J. Mordell that has stimulated much of the research on this problem.[7]
While presenting the third representation of 3 during his appearance in a video on the Youtube channel Numberphile, Booker also presented a representation for 906:
The only remaining unsolved cases up to 1,000 are the seven numbers 114, 390, 627, 633, 732, 921, and 975, and there are no known primitive solutions (i.e. ) for 192, 375, and 600.[20][23]
Primitive solutions for n from 1 to 78
n
x
y
z
n
x
y
z
1
9
10
−12
39
117367
134476
−159380
2
1214928
3480205
−3528875
42
12602123297335631
80435758145817515
−80538738812075974
3
1
1
1
43
2
2
3
6
−1
−1
2
44
−5
−7
8
7
0
−1
2
45
2
−3
4
8
9
15
−16
46
−2
3
3
9
0
1
2
47
6
7
−8
10
1
1
2
48
−23
−26
31
11
−2
−2
3
51
602
659
−796
12
7
10
−11
52
23961292454
60702901317
−61922712865
15
−1
2
2
53
−1
3
3
16
−511
−1609
1626
54
−7
−11
12
17
1
2
2
55
1
3
3
18
−1
−2
3
56
−11
−21
22
19
0
−2
3
57
1
−2
4
20
1
−2
3
60
−1
−4
5
21
−11
−14
16
61
0
−4
5
24
−2901096694
−15550555555
15584139827
62
2
3
3
25
−1
−1
3
63
0
−1
4
26
0
−1
3
64
−3
−5
6
27
−4
−5
6
65
0
1
4
28
0
1
3
66
1
1
4
29
1
1
3
69
2
−4
5
30
−283059965
−2218888517
2220422932
70
11
20
−21
33
−2736111468807040
−8778405442862239
8866128975287528
71
−1
2
4
34
−1
2
3
72
7
9
−10
35
0
2
3
73
1
2
4
36
1
2
3
74
66229832190556
283450105697727
−284650292555885
37
0
−3
4
75
4381159
435203083
−435203231
38
1
−3
4
78
26
53
−55
Popular interestedit
The sums of three cubes problem has been popularized in recent years by Brady Haran, creator of the YouTube channel Numberphile, beginning with the 2015 video "The Uncracked Problem with 33" featuring an interview with Timothy Browning.[24] This was followed six months later by the video "74 is Cracked" with Browning, discussing Huisman's 2016 discovery of a solution for 74.[25] In 2019, Numberphile published three related videos, "42 is the new 33", "The mystery of 42 is solved", and "3 as the sum of 3 cubes", to commemorate the discovery of solutions for 33, 42, and the new solution for 3.[26][27][22]
The resolution of Mordell's question by Booker and Sutherland a few weeks later sparked another round of news coverage.[21][49][50][51][52][53][54]
In Booker's invited talk at the fourteenth Algorithmic Number Theory Symposium he discusses some of the popular interest in this problem and the public reaction to the announcement of solutions for 33 and 42.[55]
Solvability and decidabilityedit
In 1992, Roger Heath-Brown conjectured that every unequal to 4 or 5 modulo 9 has infinitely many representations as sums of three cubes.[56]
The case of this problem was used by Bjorn Poonen as the opening example in a survey on undecidable problems in number theory, of which Hilbert's tenth problem is the most famous example.[57] Although this particular case has since been resolved, it is unknown whether representing numbers as sums of cubes is decidable. That is, it is not known whether an algorithm can, for every input, test in finite time whether a given number has such a representation.
If Heath-Brown's conjecture is true, the problem is decidable. In this case, an algorithm could correctly solve the problem by computing modulo 9, returning false when this is 4 or 5, and otherwise returning true. Heath-Brown's research also includes more precise conjectures on how far an algorithm would have to search to find an explicit representation rather than merely determining whether one exists.[56]
Variationsedit
A variant of this problem related to Waring's problem asks for representations as sums of three cubes of non-negative integers. In the 19th century, Carl Gustav Jacob Jacobi and collaborators compiled tables of solutions to this problem.[58] It is conjectured that the representable numbers have positive natural density.[59][60] This remains unknown, but Trevor Wooley has shown that of the numbers from to have such representations.[61][62][63] The density is at most .[1]
Every integer can be represented as a sum of three cubes of rational numbers (rather than as a sum of cubes of integers).[64][65]
^Gardiner, V. L.; Lazarus, R. B.; Stein, P. R. (1964), "Solutions of the diophantine equation ", Mathematics of Computation, 18 (87): 408–413, doi:10.2307/2003763, JSTOR 2003763, MR 0175843
^Conn, W.; Vaserstein, L. N. (1994), "On sums of three integral cubes", The Rademacher legacy to mathematics (University Park, PA, 1992), Contemporary Mathematics, vol. 166, Providence, Rhode Island: American Mathematical Society, pp. 285–294, doi:10.1090/conm/166/01628, MR 1284068
^Bremner, Andrew (1995), "On sums of three cubes", Number theory (Halifax, NS, 1994), CMS Conference Proceedings, vol. 15, Providence, Rhode Island: American Mathematical Society, pp. 87–91, MR 1353923
^Koyama, Kenji; Tsuruoka, Yukio; Sekigawa, Hiroshi (1997), "On searching for solutions of the Diophantine equation ", Mathematics of Computation, 66 (218): 841–851, doi:10.1090/S0025-5718-97-00830-2, MR 1401942
^Elkies, Noam D. (2000), "Rational points near curves and small nonzero via lattice reduction", Algorithmic number theory (Leiden, 2000), Lecture Notes in Computer Science, vol. 1838, Springer, Berlin, pp. 33–63, arXiv:math/0005139, doi:10.1007/10722028_2, ISBN 978-3-540-67695-9, MR 1850598, S2CID 40620586
^Beck, Michael; Pine, Eric; Tarrant, Wayne; Yarbrough Jensen, Kim (2007), "New integer representations as the sum of three cubes", Mathematics of Computation, 76 (259): 1683–1690, doi:10.1090/S0025-5718-07-01947-3, MR 2299795
^ abElsenhans, Andreas-Stephan; Jahnel, Jörg (2009), "New sums of three cubes", Mathematics of Computation, 78 (266): 1227–1230, doi:10.1090/S0025-5718-08-02168-6, MR 2476583
^ abHuisman, Sander G. (2016), Newer sums of three cubes, arXiv:1604.07746
^Booker, Andrew R. (2019), "Cracking the problem with 33", Research in Number Theory, 5 (26), doi:10.1007/s40993-019-0162-1, hdl:1983/b29fce73-2c20-4c07-9daf-afc04bf269b1, MR 3983550
^ abcBooker, Andrew R.; Sutherland, Andrew V. (2021), "On a question of Mordell", Proceedings of the National Academy of Sciences, 118 (11), arXiv:2007.01209, doi:10.1073/pnas.2022377118, PMC7980389, PMID 33692126
^ abLu, Donna (September 18, 2019), "Mathematicians find a completely new way to write the number 3", New Scientist
^ abHaran, Brady (September 24, 2019), 3 as the sum of 3 cubes, Numberphile
^Houston, Robin (September 6, 2019), "42 is the answer to the question 'what is (-80538738812075974)3 + 804357581458175153 + 126021232973356313?'", The Aperiodical
^Haran, Brady (November 6, 2015), The uncracked problem with 33, Numberphile
^Haran, Brady (May 31, 2016), 74 is cracked, Numberphile
^Haran, Brady (March 12, 2019), 42 is the new 33, Numberphile
^Haran, Brady (September 6, 2019), The mystery of 42 is solved, Numberphile
^Pavlus, John (March 10, 2019), "Sum-of-Three-Cubes Problem Solved for 'Stubborn' Number 33", Quanta Magazine
^Lu, Donna (March 14, 2019), "Mathematician cracks centuries-old problem about the number 33", New Scientist
^Georgiou, Aristos (April 3, 2019), "The uncracked problem with 33: Mathematician solves 64-year-old 'Diophantine puzzle'", Newsweek
^Sum of three cubes for 42 finally solved – using real life planetary computer, University of Bristol, September 6, 2019
^Miller, Sandi (September 10, 2019), "The answer to life, the universe, and everything: Mathematics researcher Drew Sutherland helps solve decades-old sum-of-three-cubes puzzle, with help from "The Hitchhiker's Guide to the Galaxy."", MIT News, Massachusetts Institute of Technology
^Lu, Donna (September 6, 2019), "Mathematicians crack elusive puzzle involving the number 42", New Scientist
^Delahaye, Jean-Paul (September 20, 2020), "For Math Fans: A Hitchhiker's Guide to the Number 42", Scientific American
^Grossman, David (September 6, 2019), "After 65 Years, Supercomputers Finally Solve This Unsolvable Math Problem", Popular Mechanics
^Quach, Katyanna (September 7, 2019), "Finally! A solution to 42 – the Answer to the Ultimate Question of Life, The Universe, and Everything", The Register
^"Matheproblem um die Zahl 42 geknackt", Die Zeit, September 16, 2019
^"Das Matheproblem um die Zahl 42 ist geknackt", Der Tagesspiegel, September 16, 2019
^Kivimäki, Antti (September 18, 2019), "Matemaatikkojen vaikea laskelma tuotti vihdoin kaivatun luvun 42", Helsingin Sanomat
^"Matheproblem um die 42 geknackt", Der Spiegel, September 16, 2019
^"Why the number 42 is the answer to life, the universe and everything", New Zealand Herald, September 9, 2019
^Firaque, Kabir (September 20, 2019), "Explained: How a 65-year-old maths problem was solved", Indian Express
^Taschwer, Klaus (September 15, 2019), "Endlich: Das Rätsel um die Zahl 42 ist gelöst", Der Standard
^"Matemáticos resuelven el enigma del número 42 planteado hace 65 años", Las Provincias, September 18, 2019
^Wærstad, Lars (October 10, 2019), "Supermaskin har løst over 60 år gammel tallgåte", Nettavisen
^"A fost rezolvată problema care le-a dat bătăi de cap matematicienilor timp de 6 decenii. A fost nevoie de 1 milion de ore de procesare", Digi24, September 16, 2019
^Paul, Fernanda (September 12, 2019), "Enigma de la suma de 3 cubos: matemáticos encuentran la solución final después de 65 años", BBC News Mundo
^Linkletter, Dave (December 27, 2019), "The 10 Biggest Math Breakthroughs of 2019", Popular Mechanics
^Mandelbaum, Ryan F. (September 18, 2019), "Mathematicians No Longer Stumped by the Number 3", Gizmodo
^"42:n ongelman ratkaisijat löysivät ratkaisun myös 3:lle", Tiede, September 23, 2019
^Kivimäki, Antti (September 22, 2019), "Numeron 42 ratkaisseet matemaatikot yllättivät: Löysivät myös luvulle 3 kauan odotetun ratkaisun", Helsingin Sanomat
^Jesus Poblacion, Alfonso (October 3, 2019), "Matemáticos encuentran una nueva forma de llegar al número 3", El Diario Vasco
^Honner, Patrick (November 5, 2019), "Why the Sum of Three Cubes Is a Hard Math Problem", Quanta Magazine
^D'Souza, Dilip (November 28, 2019), "Waste not, there's a third way to make cubes", LiveMint
^Booker, Andrew R. (July 4, 2020), 33 and all that, Algorithmic Number Theory Symposium
^Deshouillers, Jean-Marc; Hennecart, François; Landreau, Bernard (2006), "On the density of sums of three cubes", in Hess, Florian; Pauli, Sebastian; Pohst, Michael (eds.), Algorithmic Number Theory: 7th International Symposium, ANTS-VII, Berlin, Germany, July 23-28, 2006, Proceedings, Lecture Notes in Computer Science, vol. 4076, Berlin: Springer, pp. 141–155, doi:10.1007/11792086_11, ISBN 978-3-540-36075-9, MR 2282921
^Wooley, Trevor D. (1995), "Breaking classical convexity in Waring's problem: sums of cubes and quasi-diagonal behaviour" (PDF), Inventiones Mathematicae, 122 (3): 421–451, doi:10.1007/BF01231451, hdl:2027.42/46588, MR 1359599
^Wooley, Trevor D. (2000), "Sums of three cubes", Mathematika, 47 (1–2): 53–61 (2002), doi:10.1112/S0025579300015710, hdl:2027.42/152941, MR 1924487
^Davenport, H.; Landau, E. (1969), "On the representation of positive integers as sums of three cubes of positive rational numbers", Number Theory and Analysis (Papers in Honor of Edmund Landau), New York: Plenum, pp. 49–53, MR 0262198
External linksedit
Solutions of n = x3 + y3 + z3 for 0 ≤ n ≤ 99, Hisanori Mishima