Pi turns up uninvited
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.
Multiplying is turning
Complex numbers are introduced as an algebraic dodge for square roots of negatives. They are better understood as the arithmetic of rotation, at which point every rule stops needing to be remembered.
Getting pi by dropping needles on the floor
Throw a needle at a lined floor enough times, count how often it crosses a line, and pi falls out. There is no circle anywhere in the experiment.
A walk that always comes home, until it does not
Step left or right at random, forever, and the walk returns to where it started with certainty. On a grid it also returns. In space it does not, and about a third of walks leave and never come back.
Two squares, and a lattice
Whether a prime is the sum of two squares is decided entirely by its remainder on division by four. A fact about circles is settled by a fact about remainders, and neither statement contains any hint of the other.
The circle that will not square
The other three impossibilities are a number having the wrong degree. This one is a number having no degree at all — and that is a claim no finite search can establish, which makes it the one place in this field where the picture has to admit what it is not doing.
A tree that holds every triple
Three fixed matrices, applied to 3-4-5 over and over, produce every primitive Pythagorean triple there is — each of them once, none of them twice, and with no test for common factors anywhere in the procedure.
The sieve written as a product
Multiply out one geometric series for each prime and every whole number appears exactly once, as a single term. That identity turns a statement about factorisation into a statement about convergence, and it is where the analytic study of the primes begins.
The polygon an equation forces
The n solutions of z to the n equals one are the corners of a regular polygon, and nearly everything about them — that they form a group, that they sum to zero, that the equation factors into pieces with whole-number coefficients — is that picture read carefully.
The exponential of a square
The series for e makes perfect sense with a matrix in it. What comes out solves a system of equations the way the ordinary exponential solves one, and a skew matrix exponentiates into a rotation with no trigonometry anywhere.
The constant that counts what does not happen
Nothing grows in a shuffled pack of cards, and nothing grows in a factorial. Yet e sits in the middle of both — as the chance that a shuffle leaves nothing in place, and as the base that makes n! nearly a power.
An integral that cannot be a whole number
Niven's proof that π is not a fraction is the same squeeze as the one for e, with a much harder multiplier. A polynomial supplies the whole number; its own smallness supplies the contradiction; and both halves are computable.
The size of a number with no formula
There is no closed expression for the number of partitions of n. There is an expression for how large it is — with a square root in the exponent and a π in front — and it is accurate enough that rounding a few terms of its refinement gives the exact count.
One sum, squared two ways
Add the p-th roots of unity, each taken with a plus or a minus according to whether its index is a square. The walk that results closes on a point at distance √p from the origin — and squaring that one number, evaluated two different ways, is the reciprocity law.
A sum read from inside
The series 1 − 1/2 + 1/3 − 1/4 + … adds to log 2, and the reason is not in the series. Its power series equals log(1 + x) inside the interval, and the value at the edge is read off by continuity. Abel's theorem says when that reading is honest — and the series 1 − 1 + 1 − …, which has no sum, is read the same way as a half.
Nearly the most means nearly round
A shape that holds almost as much as a circle of the same perimeter must almost be a circle. Bonnesen made that exact: the ring between a convex shape's largest inscribed circle and smallest enclosing circle is never wider than √(L² − 4πA)/π. Three quite different shapes holding 99% of the circle's area all have rings under 9.55 wide, and not one of 200 random convex shapes breaks the bound.
Almost no number is one
Sums of two squares look common — a sixth of all numbers up to a million are one. The fraction is falling to nothing, at a rate so slow that no computation will ever make it obvious, and the constant in front of it has been computed to fifty places and identified with nothing.
A collision that finds a factor
A walk through the remainders modulo a number must eventually repeat, and it repeats modulo each hidden prime factor long before it repeats modulo the number. Pollard saw that the earlier repeat can be detected without knowing the prime — and that its timing is the birthday problem, so the cost is the square root of the factor.