Totient
Named by 9 essays across 4 fields — each of them below, with the objects they name alongside it.
Which polygons can be drawn
Three sides yes, seven no, seventeen yes. The list of constructible regular polygons is neither everything nor almost nothing, and the pattern in it is a fact about which numbers are one less than a power of two.
Every element is a power of one of them
Pick the right element of a finite field and its powers run through every other non-zero element exactly once before returning to one. Multiplication becomes addition of exponents, and a table of q − 1 entries replaces the whole multiplication table.
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 arithmetic that loses subtraction
Adding one to an infinite collection changes nothing, and neither does doubling it, or squaring it. What that costs is the two operations that were doing the work — an equation between infinite sizes cannot be cancelled, and how many are left stops being a question.
Every third coefficient
Add every third number in the twelfth row of Pascal's triangle and the answer is 1366 — a third of 4096, rounded up. Which way the rounding goes is decided by two arrows of length one in the complex plane, and the same average over the roots of unity counts dice totals, subsets and necklaces.
How evenly the fractions spread
List every fraction between nought and one with denominator at most n, in order. They spread across the interval almost evenly, and how fast the unevenness shrinks as n grows is — exactly, provably — the Riemann hypothesis. The link runs through a second fact: set the fractions round a circle and add them as arrows, and what is left is a whole number.
The sums of primitive roots are always whole
Take the roots of unity of order exactly q, raise each to the power n and add them. The answer is always a whole number, it depends on n only through what n shares with q, and as n varies the sums behave like the sines and cosines of a Fourier series — so well that Ramanujan could rebuild the sum of the divisors of any number from them, and prove that their weighted total is nought, a fact that at n = 1 is the prime number theorem.
Two rays for every fraction
Seen from far away, every point of the Mandelbrot set's outside has an angle, and the curves of constant angle come in to land on the set. At the root of the p/q bulb exactly two of them land, and their angles are written by the staircase under a line of slope p/q. The limbs those pairs fence off share out the whole circle of angles between them, by the identity Σ φ(q)/(2^q − 1) = 1.
Chords that never cross
Every component of the Mandelbrot set's interior has a root, and exactly two external rays land there, with angles that repeat under doubling. Which two can be found without drawing the set at all: list the angles of each period in order, and join each to the next one whose chord crosses no chord already drawn. The rule makes 63 pairs at period 7 and 2,010 at period 12, one for every component; traced into the plane, every pair's two rays end together, beside a centre of the right period and no other.
Named alongside it
The objects these essays reach for when they reach for this one.
Cyclic groupRoots of unityBinary expansionConformal mapCyclotomic polynomialDoubling mapMandelbrot setMobius functionModular arithmeticPeriodic orbitPrime number theoremPrimitive element