Concept

Congruence

The relation between two figures of the same shape and size, so that one can be carried onto the other by a rigid motion. It is what a dissection proof asserts about its pieces, and it is checked by comparing edge lengths rather than by looking.

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

Euclid's proof, without moving anything. The square on a leg and its share of the square on the hypotenuse are each exactly twice the same triangle, so they are equal. Nothing in the figure is cut or rearranged; the triangle is only looked at from the other side.

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.

geometry · Pythagoras
A knotted rope pulled into a 3-4-5 triangle. A closed loop of rope carrying 12 equally spaced knots, held at three of them so the sides are 3, 4 and 5 knots long; the angle between the two shorter sides is 90.0 degrees.

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.

geometry · Pythagoras
A triangle cut into three pieces that make a rectangle. A triangle sliced at half its height and again down the altitude of the small triangle, beside the rectangle the same three pieces make when each top piece is turned a half turn.

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.

computation · Scissors congruence
Every fifth partition count divides, and the rank that says why. A row of partition counts with the ones in a congruence class marked, and a histogram of partitions sorted by rank.

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.

number · Partitions
The primes below 100,000, by remainder mod 4. A bar for each remainder on division by 4, showing how many primes below 100000 leave it. The 2 classes sharing no factor with 4 hold near-equal counts; the rest are empty or hold one prime.

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.

number · Infinitude of primes
A dissection that never comes apart. The three pieces of the triangle-to-rectangle dissection drawn at 4 moments of the swing. Each top piece turns about a pin at the end of the slice it stands on, and the pieces stay joined throughout.

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.

computation · Scissors congruence
The quantity a cut cannot change and a turn can. 4 polygons, each with the spikes of its translation invariant drawn round a dial: the length of the edges facing each direction, less the length of those facing the opposite way. It vanishes everywhere for 3 of them.

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.

computation · Scissors congruence
A spherical triangle becomes a quadrilateral with two right angles. A triangle on a sphere with the arc through the midpoints of two of its sides, the perpendiculars dropped from its three corners, and the quadrilateral with right angles at its base that the same area makes when the two corner pieces are moved.

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.

computation · Scissors congruence
441 factored two ways among the numbers of the form 4k + 1. Two factor trees for 441 among the Hilbert numbers, those one more than a multiple of four: one splits it as 9 times 49, the other as 21 times 21, and every factor is irreducible there.

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.

number · Unique factorisation
The parities of the first 1,200 partition numbers. A 40-by-30 grid of p(n) mod 2 for n from 0 to 1199, filled where p(n) is odd; 568 are even.

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.

number · Partitions
Every cubic x³ + bx + c up to 30, sorted by its Galois group. A 61 by 61 grid of cubics x³ + bx + c: 309 reducible, lying on lines c = −r³ − rb; 20 cyclic with square discriminant; 3392 with group S3.

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.

algebra · Galois correspondence
Ramanujan's tau, scaled by the power it grows like. τ(n)/n^5.5 for n ≤ 400; τ(1..8) = 1, -24, 252, -1472, 4830, -6048, -16744, 84480; largest |τ(n)|/n^5.5 for n ≤ 10000: 3.2796 at 4841.

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.

number · Partitions
How many words can survive two lost bits. Two-deletion-correcting code sizes by length: n=4: optimum 2, greedy 2, Helberg 2; n=5: optimum 2, greedy 2, Helberg 2; n=6: optimum 4, greedy 4, Helberg 3; n=7: optimum 5, greedy 5, Helberg 4; n=8: optimum 7, greedy 6, Helberg 5; n=9: optimum 11, greedy 9, Helberg 6; n=10: optimum -, greedy 13, Helberg 8; n=11: optimum -, greedy 20, Helberg 9; n=12: optimum -, greedy 29, Helberg 11; n=13: optimum -, greedy 46, Helberg 15.

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.

computation · Error-correcting codes
How many fourth powers every number needs. Fewest fourth powers summing to n, n <= 10000000: 19 needed by 79, 159, 239, 319, 399, 479, 559; 18 by 24 numbers (last 1248); 17 by 65 (last 13792).

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.

number · Sums of two squares
Amounts arranged by remainder. Payable and unpayable amounts for coins 5 and 7, in columns modulo 5: largest unpayable 23, 12 unpayable amounts.

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.

number · Euclidean algorithm
Why 78,557 · 2ⁿ + 1 is never prime. For k=78557: 3 divides when n is 0 mod 2; 5 divides when n is 1 mod 4; 7 divides when n is 1 mod 3; 13 divides when n is 11 mod 12; 19 divides when n is 15 mod 18; 37 divides when n is 27 mod 36; 73 divides when n is 3 mod 9; every exponent covered with period 36.

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.

number · Infinitude of primes
Goldbach's comet. The number of ways to write each even number as a sum of two primes up to 12000, coloured by divisibility by 3 and 5; r(12000) = 302 and r(12002) = 115.

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.

number · Infinitude of primes
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 searchAreaDissectionOperation setPolygonConstructionInvariantModular arithmeticPrimesRigid motionUnique factorisationConjecture

All concepts