Roots of unity — the series

The 7 7th roots of unity. 7 points spaced evenly around the unit circle, at the vertices of a regular 7-sided polygon.

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.

part 1 · algebra

The coefficients of (1 + x)¹² sorted by remainder mod 3. The binomial coefficients of the 12th power coloured by the remainder of their index on division by 3, beside the 3 points one plus a root of unity, whose powers averaged pick out each colour's total.

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.

part 2 · algebra

The first 60 powers of (3 + 4i)/5. The powers of (3 + 4i)/5 marked on the unit circle, each a further turn by the same angle, with the power that comes closest to returning to 1 marked.

On the circle and never home

Every root of unity lies on the unit circle, and so does the point (3 + 4i)/5 — yet no power of it ever returns to 1. A root of a whole-number polynomial of degree ten does the same. What forces a point home is a condition on the numbers its polynomial ties it to, and how far one of them may stray is a question open since 1933.

part 3 · algebra

Six thirtieths of a turn that add to nothing. On the left a unit circle with the roots of unity in a vanishing sum marked and coloured by origin; on the right the same unit vectors placed head to tail, returning to their start.

The sums of roots of unity that add to nothing

All n of the n-th roots of unity add to zero, and so does any regular polygon among them, turned. Those are not the only vanishing sums: six thirtieths of a turn close into a loop with no polygon in them. Which counts of roots can close at all is decided by the prime factors of n — no seven fifteenths ever add to zero — and the same question counts where the diagonals of a regular polygon cross.

part 4 · algebra

The 3 periods of the 13th roots of unity, and the equation they solve. Roots of unity modulo 13 grouped by the cosets of the index-3 subgroup; the periods 0.274, 1.377, −2.651 are the roots of x³ + x² − 4x + 1.

The sums that obey a smaller equation

The twelve non-trivial thirteenth roots of unity satisfy an equation of degree twelve. Split them into three groups of four — the right three groups — and add each group: the three sums are the roots of x³ + x² − 4x + 1, an equation of degree three with whole-number coefficients. Gauss called such sums periods, found one for every divisor of p − 1, and used them to build the seventeen-gon from four quadratic equations.

part 5 · algebra

The primitive 15th roots of unity, raised to a power and added. c₁₅(1) = 1; c₁₅(3) = −2; c₁₅(5) = −4; c₁₅(6) = −2; c₁₅(10) = −4; c₁₅(15) = 8.

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.

part 6 · algebra