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

The nine-point grid, and the lines they force. 9 points with all 20 of their connecting lines drawn. The 12 carrying exactly two points are drawn solid and the rest faintly; the count is computed from the coordinates rather than read off the drawing. Geometry

The line with only two points on it

Scatter finitely many points on a page, not all in one line, and draw every line through two or more of them. However cunningly the points are placed, some line ends up carrying exactly two — and the proof is a minimisation with no algebra in it at all.

7 figures
A chord of x², and the curve under it. The curve x² with one chord drawn across it, the region between them shaded, and the midpoint heights of both marked. The comparison is computed at four hundred sample points. Analysis

The curve of the average, and the average of the curve

A curve that bends upwards keeps every one of its chords above it. That single fact, applied to a weighted average instead of a midpoint, turns into an inequality that produces the arithmetic–geometric mean inequality, Cauchy–Schwarz and the entropy bound as special cases.

7 figures
xⁿ at 5 values of n, and the limit. Several members of the sequence xⁿ drawn on one pair of axes with the function they settle on, and the largest gap between each member and that limit reported. Analysis

A limit that forgets to be continuous

Every one of the functions x, x², x³, … is as smooth as anything could be, and every column of the picture settles down. What they settle on has a jump in it — and the quantity that sees the difference is the largest gap anywhere, which is a number about the whole graph rather than about any point of it.

7 figures
The most triangle-free edges on 6 points. A graph on 6 points carrying 9 edges and no triangle, found by examining every graph on those points, with the two sides its edges cross between drawn apart. Discrete

The edge that forces a triangle

A graph on six points can carry nine edges with no three of them closing a triangle. It cannot carry ten. The bound is n²/4, the graphs that achieve it are all the same shape, and both facts fall out of examining every graph there is.

7 figures
A largest flow of 5 through two wide ends and a narrow middle. A network with a capacity on every road, the amount a largest flow sends along each, and the cut whose capacity equals that flow's value drawn as a line separating the places. Discrete

The bottleneck is the whole story

However much a network can carry from one place to another, there is a way of cutting it in two whose total capacity is exactly that number. One quantity is a maximum over ways of routing and the other a minimum over ways of severing, and they are never off by even one.

7 figures
The widest layer of the subsets of a set of 4. A Hasse diagram of a small order with the widest layer marked, and the largest set of mutually incomparable elements found by examining every subset. Discrete

The widest layer and the longest chain

Order sixteen subsets by inclusion and ask for the largest collection with no two comparable. The answer is the six subsets of size two — the widest layer — and no cleverer collection beats it. Ask instead for the fewest chains covering everything, and the answer is the same number again.

7 figures

Start anywhere

Eight of 225 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

Deepest ladders

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.

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

9 essays

Doing infinitely many things

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

27 essays

The same thing twice

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

77 essays

Throwing things away

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

30 essays

Order out of noise

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

18 essays

One point away

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

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

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

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

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

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

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

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

44 essays

All 225 essays · by ladder · by named object · by generator · what the figures prove · what is new