Lesson 1
Why 114 is open
Take a whole number k and look for integers x, y and z, negative ones allowed, with x3 + y3 + z3 = k.
Some numbers can never work. Every cube leaves a remainder of 0, 1 or 8 when divided by 9, so three cubes add up to a remainder of 0, 1, 2, 3, 6, 7 or 8. A number that leaves 4 or 5, such as 4, 5, 13 or 14, is impossible. For every other k, Roger Heath-Brown conjectured in 1992 that there are infinitely many solutions.
Small cases are easy: 3 = 13 + 13 + 13 = 43 + 43 + (−5)3. Others hide among enormous numbers. In 2019 Andrew Booker found
33 = 88661289752875283 + (−8778405442862239)3 + (−2736111468807040)3
and showed that none of the other open cases below 1000 has a solution whose smallest number is at most 1016 in size. In September 2019 Booker and Andrew Sutherland found
42 = (−80538738812075974)3 + 804357581458175153 + 126021232973356313
using about 1.3 million CPU hours on Charity Engine's volunteer PCs. That run searched every open case whose smallest number is up to 1017 in size and also turned up 165 and 906; a separate run found a third way to write 3, and a slower run that started in 2020 found 579.
Seven numbers below 1000 are still open: 114, 390, 627, 633, 732, 921 and 975. 114 is the smallest. Ponmath's hunt starts at |z| = , past every published search. Nobody knows how large the answer is, so the hunt is a lottery, not a countdown.