Louis J. Mordell
A question about 3
Mordell writes that, about 3, he knows only the two small answers, 13 + 13 + 13 and the one below, and asks whether there are more. The answer takes until 2019.
- x
- 4
- y
- 4
- z
- −5
Sums of three cubes
Seven decades of x3 + y3 + z3 = k, from a question about 3 to the seven numbers nobody has cracked. Every triple below checks in your browser, digit for digit.
9 triples to check7 still openThe Ponmath era
Louis J. Mordell
Mordell writes that, about 3, he knows only the two small answers, 13 + 13 + 13 and the one below, and asks whether there are more. The answer takes until 2019.
J. C. P. Miller and M. F. C. Woollett
Miller and Woollett put Mordell's question to EDSAC, an early computer at Cambridge, and widen it to every positive k up to 100. Their 1955 paper starts a long line of machine searches.
Elsenhans and Jahnel
With a lattice method of Noam Elkies they search every k up to 1000 with all three numbers below 1014 in size. Fourteen come up empty. Here is what happened to each of them since.
Sander Huisman
Huisman pushes the search out to 1015 and finds the first answer for 74.
Andrew Booker
Booker turns the search around, so its cost grows with the smallest of the three numbers instead of the largest, and finds 33. He also rules out every other open k below 1000 up to |z| ≤ 1016. Ponmath's search is built on the same idea.
Andrew Booker
The same search settles 795.
Andrew Booker and Andrew Sutherland · September
The last open number below 100. About 1.3 million hours of computing on Charity Engine, a grid of volunteer PCs, searching every open k below 1000 out to 1017.
Booker and Sutherland · September
The same Charity Engine run.
Booker and Sutherland · September
The same run again.
Booker and Sutherland
A further search of about 4 million computer hours on Charity Engine answers Mordell's question of 1953. The largest number has 21 digits.
Charity Engine for Booker and Sutherland · January
A slower search through 2020, reaching |z| up to 1019 for small d, turns up 579. It finds nothing for the last seven.
After 2021
Published searches stop below |z| = 1019. Ponmath's browsers sample the band , and Robinhood Chain re-checks every share in public. Nobody knows where an answer lies, or whether one lies there at all.
The Ponmath contracts are deployed on Robinhood Chain, at block . From then on a share counts only if the Hunt contract redoes the math and agrees.
Read from the chain
Shares accepted
Candidates checked (estimate)
Miners
Candidates are an estimate: the chain counts shares, and each share stands for about 225 filter survivors, times the engine's measured candidates per survivor.
No sum of three cubes is known for any of them. Shares on each, straight from the Hunt contract's allTargets().
| Target | Band | Shares | State | Hunt |
|---|---|---|---|---|
Sources: Wikipedia, Sums of three cubes; Booker, Cracking the problem with 33 (2019); Booker and Sutherland, On a question of Mordell (PNAS, 2021). Every triple on this page is checked again by your browser when you press Check it.
Seven numbers, one band, every share checked on chain. Your browser can search it.
Start hunting