Finding cyclotomic polynomials
Recursive method
Cyclotomic polynomials are defined by the equation
z
n
â
1
=
â
d
â£
n
Φ
d
(
z
)
{\displaystyle z^{n}-1=\prod _{d\,\mid \,n}\Phi _{d}(z)}
.
Solving for
Φ
n
(
z
)
{\displaystyle \Phi _{n}(z)}
, one obtains
Φ
n
(
z
)
=
z
n
â
1
â
(
d
â
n
)
â£
n
Φ
d
(
z
)
{\displaystyle \Phi _{n}(z)={\frac {z^{n}-1}{\prod _{(d\neq n)\,\mid \,n}\Phi _{d}(z)}}}
.
One can then construct any polynomial recursively, given that
Φ
1
(
z
)
=
z
â
1
{\displaystyle \Phi _{1}(z)=z-1}
:
Φ
2
(
z
)
=
z
2
â
1
z
â
1
=
z
+
1
{\displaystyle \Phi _{2}(z)={\frac {z^{2}-1}{z-1}}=z+1}
Φ
3
(
z
)
=
z
3
â
1
z
â
1
=
z
2
+
z
+
1
{\displaystyle \Phi _{3}(z)={\frac {z^{3}-1}{z-1}}=z^{2}+z+1}
Φ
6
(
z
)
=
z
6
â
1
(
z
â
1
)
(
z
+
1
)
(
z
2
+
z
+
1
)
=
z
2
â
z
+
1
{\displaystyle \Phi _{6}(z)={\frac {z^{6}-1}{(z-1)(z+1)(z^{2}+z+1)}}=z^{2}-z+1}
.
Direct method
For larger values of n, it is easier to use the direct formula, based on the Möbius inversion of the above formula:
Φ
n
(
z
)
=
â
d
â£
n
(
z
n
/
d
â
1
)
μ
(
d
)
,
{\displaystyle \Phi _{n}(z)=\prod _{d\,\mid n}(z^{n/d}-1)^{\mu (d)},}
where μ is the Möbius function . For example, one would follow these steps for n = 60:
1. Factor n.
60
=
2
2
â
3
â
5
{\displaystyle 60=2^{2}*3*5}
2. Determine the square-free divisors of n, and classify them according to whether their number of prime factors are even or odd.
30
=
2
â
3
â
5
{\displaystyle 30=2*3*5}
(Odd)
15
=
3
â
5
{\displaystyle 15=3*5}
(Even)
10
=
2
â
5
{\displaystyle 10=2*5}
(Even)
6
=
2
â
3
{\displaystyle 6=2*3}
(Even)
5
=
5
{\displaystyle 5=5}
(Odd)
3
=
3
{\displaystyle 3=3}
(Odd)
2
=
2
{\displaystyle 2=2}
(Odd)
1
=
1
{\displaystyle 1=1}
(Even, since 1 is not a prime)
3. Form the factors
z
n
/
d
â
1
{\displaystyle z^{n/d}-1}
, putting the factors from the even class in the numerator and those from the odd class in the denominator.
Φ
60
(
z
)
=
(
z
60
â
1
)
(
z
10
â
1
)
(
z
6
â
1
)
(
z
4
â
1
)
(
z
30
â
1
)
(
z
20
â
1
)
(
z
12
â
1
)
(
z
2
â
1
)
{\displaystyle \Phi _{60}(z)={\frac {(z^{60}-1)(z^{10}-1)(z^{6}-1)(z^{4}-1)}{(z^{30}-1)(z^{20}-1)(z^{12}-1)(z^{2}-1)}}}
=
(
z
30
+
1
)
(
z
2
+
1
)
(
z
10
+
1
)
(
z
6
+
1
)
{\displaystyle ={\frac {(z^{30}+1)(z^{2}+1)}{(z^{10}+1)(z^{6}+1)}}}
=
z
20
â
z
10
+
1
z
4
â
z
2
+
1
{\displaystyle ={\frac {z^{20}-z^{10}+1}{z^{4}-z^{2}+1}}}
=
z
16
+
z
14
â
z
10
â
z
8
â
z
6
+
z
2
+
1
{\displaystyle =z^{16}+z^{14}-z^{10}-z^{8}-z^{6}+z^{2}+1}
.
Construction from complex roots
It is also possible to construct a cyclotomic polynomial from the complex roots of 1:
Φ
n
(
z
)
=
â
k
=
1
Ï
(
n
)
(
z
â
e
2
Ï
k
n
j
)
{\displaystyle \Phi _{n}(z)=\prod _{k=1}^{\varphi (n)}(z-e^{{\frac {2\pi k}{n}}j})\;}
where
Ï
(
n
)
{\displaystyle \phi (n)}
is Euler's totient function . For example,
Φ
6
(
z
)
=
(
z
â
e
Ï
3
j
)
(
z
â
e
5
Ï
3
j
)
=
z
2
â
z
+
1.
{\displaystyle \Phi _{6}(z)=(z-e^{{\frac {\pi }{3}}j})(z-e^{{\frac {5\pi }{3}}j})=z^{2}-z+1.}
Some special cases
Galois Theory
The Galois group associated to the nth cyclotomic polynomial is
(
Z
/
n
Z
)
â
{\displaystyle (\mathbb {Z} /n\mathbb {Z} )^{*}}
, the group of cyclic units modulo n. Cyclotomic fields play an important part in algebraic number theory and can be used to show that certain constructions posited by ancient Greek geometers are impossible, such as trisecting the angle and constructing certain regular polygons.