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

10 essays, 20 November 2026 — everything that has been added, in order

Positions at each distance, and what sequences could reach. 0:1/1 1:9/9 2:54/54 3:321/324 4:1847/1944 5:9992/11664 6:50136/69984 7:227536/419904 8:870072/2519424 9:1887748/15116544 10:623800/90699264 11:2644/544195584 Algebra

Every position of the pocket cube

The two-by-two Rubik's cube has 3,674,160 positions once its orientation in the hand is ignored, few enough to visit every one. Breadth-first search finds that none is more than eleven face turns from solved, or fourteen quarter turns, and that only 2,644 positions sit at that distance. Counting move sequences proves only nine; the gap between nine and eleven is the cube's relations, the first of which appear at three turns. Two faces alone reach 29,160 positions, arranged by a copy of the symmetric group on five things acting on six corners.

5 figures
Two areas that are sums of n^(−n). int x^-x = 1.29128599706266; int x^x = 0.78343051071213 Analysis

An area that is a sum of n to the minus n

The area under the curve x to the power minus x, between 0 and 1, is 1 + 1/4 + 1/27 + 1/256 + …, the sum of 1/n^n. Johann Bernoulli found it in 1697, and it is called the sophomore's dream because it looks like the mistake of a student who integrates term by term without checking — except that it is true. The proof expands the exponential into layers, each with an exact area, and every layer peaks at the same point, 1/e. The peaks hold Stirling's formula, and seven terms of the series beat a thousand samples of the curve.

6 figures
Sincere approval ballots can elect any of the five. A: 111113 -> 10,0,7,7,7; B: 323221 -> 8,25,7,12,12; C: 411311 -> 8,12,19,7,12; D: 142434 -> 10,13,12,27,13; E: 231112 -> 8,6,7,7,20 Applied

Where a sincere voter stops approving

Approval voting asks each voter to tick every candidate they find acceptable, and the most ticks wins. A voter with a ranking votes sincerely by ticking a top segment of it — but the ranking does not say where the segment ends. On the 27 ballots where five classic rules elect five different candidates, some choice of sincere stopping points elects each of the five, the Condorcet loser included. The Condorcet winner can always be elected this way; with three candidates and a large electorate, almost every candidate can; and a voter unsure which race is close can do strictly better by skipping a favourite.

5 figures
A square whose every diagonal is a transversal. n=5 k=2: rows 01234 34012 12340 40123 23401 Computation

Queens on a torus, and the squares whose every diagonal is a transversal

Roll a chessboard into a torus so that its diagonals wrap round, and ask for n queens that do not attack. Pólya proved in 1918 that it can be done exactly when n shares no factor with 6, by two short sums. A Latin square whose every wrapped diagonal holds each symbol once — a Knut Vik design, from Norwegian field trials — is the same problem solved n times at once. Search finds 10, 28, 88 and 4,524 placements at 5, 7, 11 and 13; every one is a straight line until 13, where 4,394 are not.

5 figures
Eight perfect shuffles bring 52 cards home. N=52: cycles 8,8,8,8,8,2,8; order 8 Discrete

Eight perfect shuffles bring the deck home

Cut a deck of 52 cards exactly in half and interleave the halves perfectly, keeping the top card on top. Do it eight times and the deck is back in its original order. The reason is that the shuffle sends the card in position i to position 2i modulo 51, and 2 multiplied by itself eight times is 256, one more than five times 51. Keep the top card second instead and it takes fifty-two shuffles; twenty-six of them turn the deck upside down; and a magician can send the top card to any position by reading the position in binary.

5 figures
Twenty-two in binary never becomes a palindrome. 10110 100011 1010100 1101001 10110100 11100001 101101000 110010101 1011101000 1101000101 10111010000 11000101101 101111010000 110010001101 1011110100000 1100001011101 10111110100000 11000100011101 101111101000000 110000010111101 1011111101000000 1100001000111101 10111111010000000 11000000101111101 101111111010000000 Dynamics

Reverse, add, and wait for a palindrome

Take a number, add it to its own reversal, and repeat until the result reads the same both ways. 89 needs 24 steps; every start below 10,000 arrives within 24 steps, except 249 that have never been seen to arrive at all, beginning with 196. Nobody can prove that 196 never does. In base 2 the question has been settled for 22, written 10110: its orbit falls into four shapes of digit string that turn into one another, each a little longer every cycle, and no shape can read the same backwards.

6 figures

Start anywhere

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

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

37 essays

Doing infinitely many things

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

100 essays

The same thing twice

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

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

180 essays

One point away

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

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

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

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

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

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

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

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

279 essays

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