User:Ga ohoyt/Cyclotomic polynomials

From Conservapedia
This is an old revision of this page, as edited by Ga ohoyt (Talk | contribs) at 01:01, May 19, 2007. It may differ significantly from current revision.

Jump to: navigation, search

Cyclotomic polynomials are the irreducible factors of when the polynomial coefficients are restricted to the field of rational numbers. For example

z6−1 = (z−1) (z+1) (z2+z+1) (z2z+1).

The polynomial has exactly as many of these factors as there are integer factors of n. The cyclotomic polynomials are often written as , hence

z6−1 = .

The zeroes of the polynomial

are precisely the nth roots of unity, each with multiplicity 1.

The nth cyclotomic polynomial is defined by the fact that its zeros are precisely the primitive nth roots of unity, each with multiplicity 1:

where z1,...,zφ(n) are the primitive nth roots of unity, and is Euler's totient function. The polynomial has integer coefficients and is an irreducible polynomial over the rational numbers (i.e., cannot be written as a product of two positive-degree polynomials with rational coefficients). (The case of prime n, which is easier than the general assertion, follows from Eisenstein's criterion.)

Every nth root of unity is a primitive dth root of unity for exactly one positive divisor d of n. This implies that

This formula represents the factorization of the polynomial zn - 1 into irreducible factors.

z1−1 = z−1
z2−1 = (z−1)(z+1)
z3−1 = (z−1)(z2+z+1)
z4−1 = (z−1)(z+1)(z2+1)
z5−1 = (z−1)(z4+z3+z2+z+1)
z6−1 = (z−1)(z+1)(z2+z+1)(z2z+1)
z7−1 = (z−1)(z6+z5+z4+z3+z2+z+1)

Applying Möbius inversion to the formula gives

where μ is the Möbius function.

So the first few cyclotomic polynomials are

Φ1(z) = z−1
Φ2(z) = (z2−1)(z−1)−1 = z+1
Φ3(z) = (z3−1)(z−1)−1 = z2+z+1
Φ4(z) = (z4−1)(z2−1)−1 = z2+1
Φ5(z) = (z5−1)(z−1)−1 = z4+z3+z2+z+1
Φ6(z) = (z6−1)(z3−1)−1(z2−1)−1(z−1) = z2z+1
Φ7(z) = (z7−1)(z−1)−1 = z6+z5+z4+z3+z2+z+1

If p is a prime number, then all pth roots of unity except 1 are primitive pth roots, and we have

. Substituting for , this is a base z repunit. Thus a necessary (but not sufficient) condition for a repunit to be prime is that its length be prime.

Note that, contrary to first appearances, not all coefficients of all cyclotomic polynomials are 1, −1, or 0; the first polynomial where this occurs is , since 105=3×5×7 is the first product of three odd primes. Many restrictions are known about the values that cyclotomic polynomials can assume at integer values. For example, if is prime and then or .