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, 14 October 2026 — everything that has been added, in order

Knowing the coin, learning it, and guessing it once. p=0.6, 2000 tosses; final log10 wealth: hindsight 19.30, knew p 19.25, learned 17.73, plug-in from 20 tosses (15 heads, f=0.50) -25.88. Probability

What not knowing the coin costs

Kelly's rule stakes the edge, and the edge is the one thing a bettor never has. Estimate it from twenty tosses and stake the estimate, and a lucky start can turn a favourable coin into certain ruin. Learn it toss by toss instead, with Laplace's rule, and the cost of ignorance shrinks to a factor of about the square root of the number of tosses — because a bettor who learns is exactly a bettor who split the money among every fixed fraction at once.

6 figures
Twelve studies of one coin, three ways of adding them up. theta=0.6, 12 studies of 40: heads 26,21,25,25,25,22,25,20,23,34,22,27; log10 learned product 0.06,-0.33,0.10,0.56,1.05,1.00,1.49,1.13,1.30,3.42,3.35,4.27; fresh 0.06,-0.63,-0.80,-0.98,-1.16,-1.78,-1.96,-2.67,-3.19,0.66,0.03,0.38; Fisher p 8.07e-2,2.58e-1,1.71e-1,1.19e-1,8.54e-2,1.34e-1,9.71e-2,1.72e-1,1.96e-1,7.44e-4,1.40e-3,4.71e-4; cross at 7 (learned e) and 10 (p). Probability

Evidence that can be multiplied

A p-value from one study and a p-value from the next cannot simply be multiplied, and a researcher who decides whether to run the next study by looking at the last one quietly breaks the rule that combines them. An e-value — a number whose average under the null is at most one — can be multiplied, study after study, under any rule for continuing, and never passes twenty to one more than one time in twenty. What it costs is tosses, and what it demands is a decision about which alternatives to be good at finding.

6 figures
Every closed curve with three crossings. Six sphere curves with 3 crossings; plane counts 2, 3, 3, 3, 4, 5 (total 20); symmetries 12, 6, 4, 4, 2, 2. Topology

How many ways a curve can cross itself

A closed curve that crosses itself three times can be drawn in exactly six essentially different ways on a sphere, and twenty in the plane. Four crossings give nineteen and eighty-two; six give 376 and 2,645. Every one of them is a word — the order in which the crossings are met — and a choice of direction at each crossing, and the whole census comes from asking which of those choices close up on a sphere.

6 figures
Every failed branch datum up to eight sheets. Exceptions with three branch points: 4: 31|22|22; 6: 51|222|222; 6: 42|411|222; 6: 42|222|222; 6: 33|33|3111; 6: 33|321|222; 8: 71|2222|2222; 8: 62|5111|2222; 8: 62|2222|2222; 8: 611|422|2222; 8: 53|3311|2222; 8: 53|2222|2222; 8: 521|422|2222; 8: 5111|44|2222; 8: 5111|422|422; 8: 44|44|311111; 8: 44|3221|2222; 8: 431|332|2222; 8: 422|332|2222. Topology

The lists no covering can have

A covering of the sphere by itself with three branch points is three permutations of the sheets whose product is the identity. The Riemann–Hurwitz count says which lists of cycle shapes might work, and a search through every permutation says which do. Up to thirteen sheets, 150 lists pass the count and fail the search — and not one of them has a prime number of sheets.

6 figures
The largest primes of n and n + 1, side by side. Joint law of t(n), t(n+1) for 1000≤n<1e7 in 24×24 cells: corner (both near prime) 0 against 44149 expected; other ratios 0.268 to 2.582. Number

Two neighbours share out their small primes

A number and the next one have no prime in common, and the natural guess is that their largest primes are independent. In the limit that is believed and nearly proved. Below ten million it is visibly false: neighbours are both made of small primes only nine-tenths as often as independence predicts, a run of four only two-thirds as often, and the correlation between their largest primes is negative at distance one and positive at distance six — because a small prime that divides one of two neighbours is a small prime the other cannot have.

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

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.

6 figures

Start anywhere

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

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

32 essays

Doing infinitely many things

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

92 essays

The same thing twice

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

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

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

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

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

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

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

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

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

217 essays

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