Concept

Diophantine equation

A polynomial equation whose solutions are required to be whole numbers, such as x³ + y³ + z³ = n. Asking for whole-number solutions turns easy algebra into hard number theory, and no single method decides every such equation.

Named by 4 essays across 3 fields — each of them below, with the objects they name alongside it.

Where 3003 appears eight times. 3003 = C(3003,1) = C(78,2) = C(15,5) = C(14,6) and their mirror images; N(3003) = 8.

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.

discrete · Pascals triangle
The numbers below a hundred as sums of three cubes. Smallest solution size per n < 100: 1:9 2:1 3:1 6:2 7:2 8:16 9:2 10:2 11:3 12:11 15:2 16:2 17:2 18:3 19:3 20:3 21:16 24:2 25:3 26:3 27:6 28:3 29:3 30:10d 33:16d 34:3 35:3 36:3 37:4 38:4 39:6d 42:17d 43:3 44:8 45:4 46:3 47:8 48:4 51:796 52:11d 53:3 54:3 55:3 56:4 57:4 60:5 61:5 62:3 63:4 64:6 65:4 66:4 69:5 70:21 71:4 72:4 73:4 74:15d 75:9d 78:55 79:35 80:4 81:3 82:14 83:4 84:8d 87:4271 88:5 89:7 90:4 91:4 92:4 93:7 96:22 97:5 98:5 99:4.

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.

number · Sums of two squares
A box with whole diagonals on every face. 44,117,240: face diagonals 267, 244, 125; space diagonal squared 73225.

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.

geometry · Pythagoras
Five powers of two that are seven more than a square. How close 2ⁿ − 7 comes to a square for n from 3 to 40, as a fraction of the gap between neighbouring squares: squares at n = 3, 4, 5, 7, 15 (1, 3, 5, 11, 181 squared), and at no other n up to 10000.

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.

number · Unique factorisation

Named alongside it

The objects these essays reach for when they reach for this one.

Exhaustive searchConjectureBinomial coefficientCongruenceDivisibilityElliptic curveFibonacci numbersHeuristicHilberts tenth problemModular arithmeticParametrisationPascals triangle

All concepts