Mathematics, in pictures.

Some mathematical ideas are hard because they are genuinely hard. Others are hard only because nobody drew them properly. This is a collection of essays about the second kind — one idea at a time, illustrated to the point where the argument becomes visible.

Pascal's triangle mod 2, 32 rows. Only the odd entries are drawn; the pattern that appears is the Sierpiński triangle.
Fig. 1 Pascal’s triangle with the odd numbers shaded and the even ones left blank. Nothing here was designed to make a pattern; the pattern is a consequence of the arithmetic. See Pascal’s triangle, two colours.

Recently added

22 essays, 23 October 2026 — everything that has been added, in order

Two polynomials that factor alike at every prime. 5:8 7:2+2+2+2 11:1+1+2+2+2 13:1+1+1+1+2+2 17:8 19:4+4 23:1+1+2+2+2 29:8 31:2+2+2+2 37:4+4 41:8 43:4+4 47:1+1+2+2+2 53:8 59:1+1+2+2+2 61:4+4 67:4+4 71:1+1+2+2+2 73:4+4 79:2+2+2+2 83:1+1+2+2+2 89:8 97:4+4 101:8 103:2+2+2+2 107:1+1+2+2+2 109:1+1+1+1+2+2 113:8 127:2+2+2+2 131:1+1+2+2+2 137:8 139:4+4 149:8 151:2+2+2+2 157:4+4 163:4+4 167:1+1+2+2+2 173:8 179:1+1+2+2+2 181:1+1+1+1+2+2 191:1+1+2+2+2 193:2+2+2+2 197:8 199:2+2+2+2 211:4+4 223:2+2+2+2 Algebra

Two fields that every prime confuses

Reduce x⁸ − 3 and x⁸ − 48 modulo any prime other than 2 and 3 and factor them: the two lists of factor degrees are the same, at all 9,590 such primes below 100,000. The fields the two equations define are still different. The reason is a pair of ways for one group to permute eight roots, with the same cycle lengths element by element and different fixed points — the same coincidence, in degree seven, as the points and lines of the Fano plane.

7 figures
Three roots that one map rotates, for every t. Shanks cubic roots for t in [-9,6]; at t=2: 3.507019, -0.221876, -1.285142; map permutation 1,2,0. Algebra

A line of cubics that are all cyclic

In a box of cubics the full group of six symmetries is almost universal, and the three rotations are a rare exception. Daniel Shanks's x³ − tx² − (t + 3)x − 1 has the rotations at every whole t, and at every rational one. Its discriminant is the square of t² + 3t + 9, its roots are turned into one another by x ↦ −1/(1 + x), and on a suitable circle every member is an equilateral triangle.

6 figures
Two thinned harmonic series that never stop growing. every n: 10d 23.603067, 40d 92.680619, 120d 276.887427; no digit 9: 10d 15.109789, 40d 22.589564, 120d 22.920604; as many 7s as 3s: 10d 11.327995, 40d 24.391523, 120d 43.428896; digit sum a prime: 10d 7.156214, 40d 21.096266, 120d 51.331792 Analysis

A rule that counts lets the sum escape

Strike out every number containing a 9 and the harmonic series converges, to 22.92. Keep only the numbers with as many 7s as 3s and it diverges — slowly, like the square root of the number of digits. Ask for two such balances and it still diverges; ask for three and it converges. The dividing line is Pólya's theorem that a random walk comes home in one and two dimensions and not in three.

6 figures
A set's share of a shrinking window, at three points. a point of the set x=0.33155689: density at r=1e-1 0.5633, 1e-3 0.9885, 1e-5 0.99695; the middle of a gap x=0.07812500: density at r=1e-1 0.6250, 1e-3 0.0000, 1e-5 0.00000; the end of a gap x=0.07031250: density at r=1e-1 0.6250, 1e-3 0.4971, 1e-5 0.49998 Analysis

No set fills half of every interval

A fat Cantor set has length one half and contains no interval, so every interval holds some of it and some of its gaps. Look closely at any one point, though, and the window around it ends up almost all set or almost all gap. Lebesgue proved in 1910 that this is forced for every set with a length: the share of a shrinking window is 0 or 1 almost everywhere. So no set can fill exactly half of every interval, however it is built.

6 figures
How often each rule finds the Condorcet winner. n=3: 0.8824/0.9412/0.9559/0.6471; n=5: 0.8259/0.9751/0.9378/0.6866; n=7: 0.8281/0.9578/0.9278/0.6833; n=11: 0.8054/0.9656/0.9179/0.7079; n=21: 0.7941/0.9619/0.9097/0.7205; n=51: 0.7804/0.9624/0.9046/0.7339; limit 0.7572±0.0009/0.9629±0.0004/0.9011±0.0006/0.7563±0.0009; P(CW) limit 0.9116. Applied

How often the rules find the majority favourite

When one candidate beats every rival head to head, a voting rule ought to elect it. Plurality does about three times in four when every ranking is equally likely, the runoff between the top two 96 times in a hundred, Borda's count 90. Every profile of up to 51 voters is counted exactly, the limit is sampled, and adding candidates pulls plurality down below one half.

5 figures
The number of stable matchings in a random market. n=10 (400): mean 3.03±0.10, median 3, 10-90% 1-5, max 20, e^-1 n ln n 8.5; n=20 (400): mean 6.34±0.18, median 6, 10-90% 3-10, max 33, e^-1 n ln n 22.0; n=40 (400): mean 15.51±0.48, median 13, 10-90% 7-26, max 87, e^-1 n ln n 54.3; n=70 (400): mean 33.10±0.92, median 29, 10-90% 16-56, max 147, e^-1 n ln n 109.4; n=100 (400): mean 54.84±1.46, median 48, 10-90% 26-90, max 230, e^-1 n ln n 169.4; n=150 (400): mean 93.47±2.51, median 79, 10-90% 49-164, max 350, e^-1 n ln n 276.5; n=200 (200): mean 144.33±5.75, median 128, 10-90% 71-229, max 589, e^-1 n ln n 389.8; n=300 (100): mean 239.96±12.32, median 203, 10-90% 128-409, max 669, e^-1 n ln n 629.5; n=500 (40): mean 409.55±24.38, median 410, 10-90% 212-663, max 799, e^-1 n ln n 1143.1; n=700 (16): mean 648.44±83.83, median 573, 10-90% 323-1286, max 1504, e^-1 n ln n 1687.0; n=1000 (10): mean 1053.30±211.84, median 807, 10-90% 458-2467, max 2467, e^-1 n ln n 2541.2 Applied

How many stable matchings a market has

A market with random preferences on both sides has not one stable matching but many — a few at ten a side, a few dozen at a hundred, about a thousand at a thousand — and all of them are reached from the proposers' best by a chain of rotations. Boris Pittel proved that the average grows like n ln n / e. The averages measured here sit at a third of that at every size a computer can reach.

5 figures

Start anywhere

Eight of 1100 essays — the whole collection is a click away, or search it.

The Pythagorean theorem by dissection. Two squares of the same size. Each holds four copies of one right triangle. The space left over is a single tilted square on the left and two upright squares on the right. Geometry

Two squares, four triangles, and no algebra

The Pythagorean theorem is usually met as a formula to be memorised. It is much better met as a rearrangement that can be checked by eye.

7 figures
Odd numbers as square shells. Nested L-shaped shells of 1, 3, 5 … 11 cells stack into a 6 by 6 square. Geometry

Every square is a stack of odd numbers

Add up the odd numbers in order and the running totals are 1, 4, 9, 16, 25. This is not a coincidence, and the reason fits in a single picture.

7 figures
Euclid's algorithm on a 34 by 13 rectangle. The rectangle is tiled by peeling off the largest square that fits, again and again, until nothing is left. Geometry

The oldest algorithm, drawn as a tiling

Euclid's method for finding a greatest common divisor is usually presented as a loop. It is also a way of tiling a rectangle with squares, and the tiling explains why it works.

7 figures
The five Platonic solids. Tetrahedron, cube, octahedron, dodecahedron and icosahedron, drawn at a common scale. Geometry

Why the list of perfect solids stops at five

There are infinitely many regular polygons and exactly five regular solids. The reason is not deep, but it is very sharp, and it can be checked on a single row of corners.

8 figures
Four conic sections from one cone. Circle, ellipse, parabola and hyperbola, produced by tilting a single cutting plane further and further. Geometry

One cone, four curves

The circle, the ellipse, the parabola and the hyperbola look like four separate objects with four separate equations. They are one object, cut at four angles.

6 figures
A circle unrolled into a sine wave. On the left a radius turns through an angle; on the right the height of its tip is plotted against the angle, tracing a sine curve. Analysis

A sine wave is a circle seen from the side

Sine is introduced as a ratio in a right triangle, which is true and explains nothing about why its graph is a wave. There is a better picture.

7 figures
8 rectangles under a curve. A left-endpoint Riemann sum with 8 rectangles approximating the area under a curve. Analysis

Adding up rectangles until they stop being rectangles

The integral is defined as a limit of sums of rectangles. The definition is exact, the picture is honest about what it costs, and the gap between them is the whole subject.

7 figures
Partial sums of the square wave. Approximations using 1, 3, 7, 21 terms; the corners sharpen but a fixed overshoot remains. Analysis

A square wave built entirely out of round ones

Add enough sine waves together and flat tops and vertical cliffs appear from nothing. Almost — there is a 9% overshoot that never goes away, and it is not a bug.

7 figures

The eleven fields

the spine — every essay sits in exactly one

Longest series

one idea, several arguments — all 134 of them

Threads running through

themes, not categories

Proof without words

Arguments that are complete once they have been looked at properly. Not illustrations of proofs — the proofs themselves.

102 essays

Pi turns up uninvited

A constant defined by circles, appearing in places with no circle anywhere in sight, and what that tends to mean.

33 essays

Doing infinitely many things

Sums that never end, subdivisions that never stop, and the care required to make either of them mean something.

96 essays

The same thing twice

Two constructions that look unrelated and turn out to be the same object wearing different clothes.

453 essays

Throwing things away

Progress made by deleting detail: the map that becomes a graph, the shape that becomes a number.

67 essays

Order out of noise

Random processes that reliably produce the same shape, and the reason that is less mysterious than it looks.

169 essays

One point away

Constructions that work perfectly except at a single exceptional place, and what is done about it.

51 essays

Things that cannot be done

Results that close a door rather than open one — and the peculiar difficulty of drawing a picture of something that does not exist.

269 essays

Counting the same thing twice

One collection, counted by two different methods, and an identity that falls out because both answers have to agree. The proof is the pair of counts.

297 essays

Sensitive to everything

Systems where a difference too small to draw becomes the whole difference, and the reason that is a property of the rule rather than of the measurement.

36 essays

Small rules, large behaviour

Rules short enough to write on one line, producing behaviour nobody can summarise — and the finding that the size of a rule predicts nothing about the difficulty of the questions it raises.

70 essays

What a system cannot say

Rules asked a question about themselves, and an answer that is provably not available from inside — which is a different kind of limit from not knowing yet.

93 essays

Decided by exhaustion

Questions with finitely many cases, settled by going through all of them — and what changes when a claim about every argument becomes a count.

303 essays

Small cases lie

Patterns that hold for every example anyone would check by hand, and then stop. The cases within reach are not a sample of the cases.

243 essays

All 1100 essays · by series · by named object · by figure · what the figures prove · what is new