Diophantine equation
Named by 4 essays across 3 fields — each of them below, with the objects they name alongside it.
How often a number can appear in Pascal's triangle
Every number bigger than one appears in Pascal's triangle at least twice, next to the 1 at each end of its own row. A few appear more often: 120 appears six times, and 3003 eight — as C(3003, 1), C(78, 2), C(15, 5) and C(14, 6), each twice. Counting every entry up to a million million finds seven numbers that appear more than four times and none that appear five, seven or more than eight. Whether any number appears ten times, or whether there is any limit at all, is unknown.
Thirty-three as three cubes
Which numbers are a sum of three cubes, allowing negatives? Nothing like the rule for two squares is known — only that numbers leaving 4 or 5 on division by 9 are impossible. Every other number below a hundred has a sum with cubes under 5,000, except eight; 33 needed sixteen-digit cubes and was found in 2019.
A box with every face diagonal whole
Pythagoras gives a rectangle with whole sides and a whole diagonal — 3, 4, 5. A box with whole edges and whole diagonals on all three faces is far rarer: the smallest is 44 × 117 × 240, found in 1719, and there are only 113 essentially different ones with every edge below 300,000. Ask for the long diagonal through the box to be whole as well and the answer is unknown. No such perfect box has ever been found, and nobody has proved there is none.
Five powers of two, seven more than a square
2³ − 7 = 1², 2⁴ − 7 = 3², 2⁵ − 7 = 5², 2⁷ − 7 = 11², 2¹⁵ − 7 = 181². Ramanujan asked in 1913 whether there are any more. Testing every exponent up to 10,000 finds none, and Nagell proved in 1948 that none exist, by moving to a number system where 2 splits into two primes and factorisation is still unique. The same five solutions decide when a two-error-correcting code can be perfect.
Named alongside it
The objects these essays reach for when they reach for this one.
Exhaustive searchConjectureBinomial coefficientCongruenceDivisibilityElliptic curveFibonacci numbersHeuristicHilberts tenth problemModular arithmeticParametrisationPascals triangle