Congruence
Named by 18 essays across 4 fields — each of them below, with the objects they name alongside it.
Euclid proves it without moving anything
The rearrangement proof cuts and slides. Euclid's does neither — it shows that a square and a rectangle are each exactly twice the same triangle, seen from opposite sides, and that is harder to hold in the head for a reason worth understanding.
The rope that squares a corner
The theorem turns two sides into a third. Run it backwards and it turns three lengths into a right angle — which is a different statement, needs its own proof, and is the only one of the two that has ever been used to build anything.
Equal area is enough, and equal volume is not
Any two polygons of the same area can be cut into each other with finitely many straight cuts. The same sentence with area replaced by volume and polygon by polyhedron is false, and what blocks it is an angle.
Every fifth one divides
p(4) is 5, p(9) is 30, p(14) is 135, and every partition count at a number leaving four on division by five is divisible by five. Ramanujan read it off a table; the explanation is a way of splitting those partitions into five equal heaps.
Infinitely many of one kind
Euclid's argument produces a prime nobody had listed, and says nothing about what it looks like. Ask for infinitely many primes ending in 3, or leaving a remainder of 1 on division by 4, and the same construction has to be aimed — and for most targets nobody knows how to aim it.
A dissection that never comes apart
The plane theorem lets the pieces be picked up and put down anywhere. Require instead that they stay joined at their corners and swing, and the theorem survives — which was open for a century and is a much stronger statement about the same cuts.
Slid, but never turned
The classical dissections all turn their pieces. Forbid the turn — allow the pieces to be slid and nothing else — and equal area stops being enough, for a reason that is a single number attached to each direction and that a cut cannot change.
Equal area on a sphere, without a rectangle
On a sphere, two polygons of the same area can still be cut into each other, exactly as in the plane. Almost nothing in the plane proof survives the move: a sphere has no rectangles, no parallel strips and no similar triangles of different sizes. What carries the theorem instead is a quadrilateral with two right angles, built from a triangle's midline.
A factorisation that hides its primes
Keep only the whole numbers one more than a multiple of four. They multiply among themselves and nothing is lost — yet 441 is 9 × 49 and also 21 × 21, and every one of those factors is unbreakable there. Unique factorisation turns out not to be a fact about multiplication at all.
Is the partition count even half the time?
The number of partitions of n is even for 50.0% of the n up to half a million, its runs of one parity are as long as a coin's, and nothing proves that the share is a half — the best theorems only show there are at least about √n of each. Modulo 5 and 7 the zeros carry Ramanujan's congruences and something more: an excess that follows whether 1 − 24n is a square.
Twenty-seven million cubics, sorted by their symmetry
Write down every cubic x³ + ax² + bx + c with coefficients up to 150 and sort each by its Galois group. 98.7% have all six symmetries of three roots. The rest are reducible at a rate of fifteen in every H², or cyclic at five in every H to the three-halves — and the cyclic ones turn up four times as often as chance would allow, because discriminants are not random numbers.
The product raised to the twenty-fourth power
Euler's product (1 − q)(1 − q²)(1 − q³)… has the partition numbers for its reciprocal. Raise it to the twenty-fourth power and multiply by q, and the coefficients that come out — 1, −24, 252, −1472, 4830, −6048 — multiply like the primes they are indexed by, stay inside a bound Ramanujan guessed and Deligne proved fifty-eight years later, agree with a divisor sum modulo 691, and know, modulo 23, how a cubic equation factors.
Two lost bits
One congruence repairs any single lost bit, and the set of words it defines is believed to be the best possible. Two lost bits defeat it. An exhaustive search finds the largest codes that survive two — 2, 2, 4, 5, 7 and 11 words for lengths 4 to 9 — and Helberg's congruence, with weights that grow like Fibonacci numbers, gives a code that provably works at every length but spends a fixed share of every bit on protection. The best codes need only about four times the logarithm of the length.
Nineteen fourth powers, and then sixteen
Edward Waring claimed in 1770 that every number is a sum of at most nineteen fourth powers. It is true, and it is needed: 79 takes nineteen, because its remainder on division by sixteen forces fifteen ones. But only seven numbers need nineteen, the last of them 559; the last to need eighteen is 1,248, and the last to need seventeen is 13,792. Counting every number to ten million shows the stragglers thinning out and the one obstruction that never goes away — the remainder modulo sixteen, which makes 31, 496, 7,936 and every 31·16ᵐ need sixteen for ever.
The largest amount two coins cannot pay
With coins of 5 and 7, the amounts 1, 2, 3, 4, 6, 8, 9, 11, 13, 16, 18 and 23 cannot be paid, and everything else can. Two lines of argument give the formula ab − a − b for the last gap, and half the rest of the board is gaps. For three coins no such formula exists, in a sense that can be proved. And the sets that coins can make have a count that climbs at the golden ratio, a conjecture settled from a table of 67, 118, 204.
Numbers that never make a prime
Multiply 78,557 by a power of two and add one. The result is never prime, for any power, though almost every other odd number gives a prime within a few doublings. The reason is that seven small primes take it in turn to divide the result, on a schedule repeating every 36 steps that leaves no step uncovered. Proving nothing smaller does this has taken sixty years of search, and five candidates are still running.
The comet Goldbach left behind
Count the ways each even number is a sum of two primes, and the points do not form a smear. They split into bands: 12,000 has 302 ways and 12,002 has 115. One small product over odd prime factors explains every band and brings them all to a single line, and it says the count grows without bound. Nobody can prove the count is never nought.
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 searchAreaDissectionOperation setPolygonConstructionInvariantModular arithmeticPrimesRigid motionUnique factorisationConjecture