Roots of unity — the series
-
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.
-
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.
-
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.
-
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.
-
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.
-
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.
-
How near nought a sum of roots can come
Five arrows of length one, each pointing at a 122nd root of unity, laid end to end, return to within fifteen millionths of where they started. No five of the 123rd roots come within a thousandth. Two, three and four arrows shrink their smallest miss in a tidy power of n; five scatter over four powers of ten from one n to the next, and nobody knows the law they follow.
-
A prime leaves no room for a comb
Take the table of powers of a root of unity, pick any rows and any equal number of columns, and take the determinant. At order 12 about one such determinant in six is exactly nought. At order 11, among 184,756 of them, none is, and in 1926 Chebotarev proved that none ever is at a prime. It means a signal on p places and its transform together occupy at least p + 1, while a comb on twelve places and its transform take 4 and 3.