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

15 essays, 2 October 2026 — everything that has been added, in order

Every three-state machine and what becomes of it. halt: 1379; no halting entry: 12492; exact repeat: 361; shifted repeat: 2254; dies backwards: 36; unexplained: 27. Logic

The machines that need a reason never to stop

Run every three-state machine on a blank tape and the ones that halt announce themselves: the longest stops after 21 steps. The work is in the others. Each needs a reason it will never stop, and four simple kinds of reason settle all but 27 of them — machines that sweep back and forth over a growing tape and defeat every check that looks for a repeat.

5 figures
Rule 30 from one cell, 120 steps, and its centre column. The rule 30 triangle grown from a single cell for 120 rows, with the centre column outlined; it begins 110111001100010110010011. Dynamics

The column rule 30 will not explain

Start rule 30 from one live cell and read down the middle. The column has passed every test of randomness tried on it, and three plain questions about it are open: whether it ever repeats, whether its 1s make up half of it, and whether its n-th cell can be had without n steps of work. What can be measured says something about each — and the diagonals beside it are periodic, with periods that double going inwards.

5 figures
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. Number

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.

6 figures
Apéry's proof for ζ(3), as three numbers. log₁₀ of 2·lcm(1, …, n)³, of |a(n)ζ(3) − b(n)| and of their product for n up to 60: slopes 1.262, -1.546, -0.284 per step. Number

The race that makes ζ(3) irrational

Roger Apéry's 1978 proof that the sum of the reciprocal cubes is not a fraction comes down to a race between two numbers. A whole-number multiplier grows by a factor of ten every 0.79 steps; the gap it multiplies shrinks by a factor of ten every 0.65. The gap wins, by a margin of about seventeen per cent, and that margin is the whole proof.

5 figures
Three polynomials of signs around the circle. The size of the polynomial around the unit circle divided by √64 for all-plus, random and Rudin–Shapiro sign polynomials of length 64; maxima 8.00, 2.50, 1.41. Algebra

The flattest polynomials of signs

A polynomial whose coefficients are all +1 or −1 has average size √n on the unit circle. Keeping it near √n everywhere is the problem Littlewood posed: the Rudin–Shapiro polynomials never exceed √2 times it, searching every sign pattern up to length 22 finds the best are the Barker sequences, and whether the maximum can come arbitrarily close to √n is still open.

5 figures
Where interpolation through 11 nodes magnifies an error. Lebesgue functions of equispaced, Chebyshev and optimal nodes of degree 10; constants 29.900, 2.489, 2.052. Analysis

The best nodes have no formula

Interpolating through n points magnifies any error in the data by at most the Lebesgue constant of the points. Chebyshev's points keep it near (2/π)·log n; stretching them to the ends of the interval brings it within two hundredths of the best possible; and the best possible points, characterised in 1978 by having every bump of the error curve the same height, have never been given a formula.

5 figures

Start anywhere

Eight of 846 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.

97 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.

26 essays

Doing infinitely many things

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

80 essays

The same thing twice

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

353 essays

Throwing things away

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

64 essays

Order out of noise

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

112 essays

One point away

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

46 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.

217 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.

235 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.

30 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.

46 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.

66 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.

232 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.

168 essays

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