Cyclotomic polynomial

The polynomial Φ_n(x) whose roots are the primitive n-th roots of unity; it factors x^n−1 and is irreducible over Q.
Cyclotomic polynomial

Fix an integer n1n\ge 1. In an of a field of characteristic 00 (e.g. inside C\mathbb{C}), an element ζ\zeta is a if ζn=1\zeta^n=1 and ζd1\zeta^d\ne 1 for every proper divisor dnd\mid n. The nn-th cyclotomic polynomial is

Φn(x)  :=  1kngcd(k,n)=1(xζnk), \Phi_n(x) \;:=\; \prod_{\substack{1\le k\le n\\ \gcd(k,n)=1}} (x-\zeta_n^{\,k}),

where ζn\zeta_n is any fixed primitive nn-th root of unity. This definition is independent of the choice of ζn\zeta_n, and Φn(x)Z[x]\Phi_n(x)\in\mathbb{Z}[x] is monic.

A key structural identity is the factorization

xn1  =  dnΦd(x), x^n-1 \;=\; \prod_{d\mid n}\Phi_d(x),

which can be taken as an equivalent recursive definition of Φn\Phi_n in Z[x]\mathbb{Z}[x]. Over Q\mathbb{Q}, Φn(x)\Phi_n(x) is irreducible, so it is the minimal polynomial of ζn\zeta_n and

[Q(ζn):Q]=degΦn=φ(n), [\mathbb{Q}(\zeta_n):\mathbb{Q}]=\deg \Phi_n=\varphi(n),

linking cyclotomic polynomials to the Q(ζn)\mathbb{Q}(\zeta_n) and the of xn1x^n-1.

Examples

  1. Φ1(x)=x1\Phi_1(x)=x-1, Φ2(x)=x+1\Phi_2(x)=x+1, Φ3(x)=x2+x+1\Phi_3(x)=x^2+x+1, Φ4(x)=x2+1\Phi_4(x)=x^2+1.

  2. For an odd prime pp,

    Φp(x)=1+x+x2++xp1. \Phi_p(x)=1+x+x^2+\cdots+x^{p-1}.
  3. Using x61=d6Φd(x)x^6-1=\prod_{d\mid 6}\Phi_d(x) and the known Φ1,Φ2,Φ3\Phi_1,\Phi_2,\Phi_3, one gets

    Φ6(x)=x61(x1)(x+1)(x2+x+1)=x2x+1. \Phi_6(x)=\frac{x^6-1}{(x-1)(x+1)(x^2+x+1)}=x^2-x+1.