]> Number Theory - Cyclotomic Equations

Number Theory

Cyclotomic Equations

We try to solve the cyclotomic equation x p1 =(x1 )(x p1 +x p2 +...+1 )=0 algebraically. (Transcendentally, we know the roots are e 2 πik/p for k=0 ,...,p1 .)

It can be easily shown that if gcd(m,n)=1 , then a primitive mth root of unity times a primitive nth root of unity is a primitive mnth root of unity, thus we need only consider prime powers. But then if α is a primitive pth root of unity, then αk1 is a primitive p kth root of unity, so we need only consider the case where p is prime.

In general we can use Gauss' method, but let us see how far elementary methods lead us.

p=3 : we merely solve the quadratic x 2 +x+1 =0 to obtain x=1 ±i3 2

p=5 : we could solve the quartic x 4 +x 3 +x 2 +x+1 =0 but since it is palindromic we make the variable substitution y=x+1 /x, and solve y 2 +y1 =0 to find y=1 ±5 2 and x 2 yx+1 =0 implies x=y±y 2 4 2 giving the four solutions x=5 1 ±2 5 10 4 ,5 1 ±2 5 10 4

p=7 : the palindrome yields a cubic which can be solved for x.

p=11 : the palindrome yields a quintic. Now elementary methods fail us and we need resort to Gauss' method. Vandermonde did just that, and we outline his answer in preparation for later.

Set β to a primitive 10 th root of unity (so it is the negation of one of the solutions for the p=5 case above).

Suppose ζ is a primitive 11 th root of unity. Notice that 2 is a generator of 11 * as the powers of 2 are 2 ,4 ,8 ,5 ,10 ,9 ,7 ,3 ,6 ,1 . Define t 1 =ζ+βζ 2 +β 2 ζ 4 +...+β 9 ζ 6 and for t 2 ,...,t 10 define t i equal to t with β replaced by β i. We shall see that t i 10 can be expressed in terms of β easily for all i.

Then ζ=1 10 (t 1 +...+t 10 )=1 10 (t 1 10 10 +...+t 10 10 10 ) where we need to choose the correct 10th roots to find ζ. It turns out that t it 1 10 i is also easily expressed in terms of β, hence we may pick any 10th root of t 1 and then derive the values of t 2 ,...,t 10 .