A polynomial given by

(1)

where are the roots of unity in given by

(2)

and runs over integers relatively prime to . The prime may be dropped if the product is instead taken over primitive roots of unity, so that

(3)

The notation is also frequently encountered. Dickson et al. (1923) and Apostol (1975) give extensive bibliographies for cyclotomic polynomials.

The cyclotomic polynomial for can also be defined as

(4)

where is the Möbius function and the product is taken over the divisors of (Vardi 1991, p. 225).

is an integer polynomial and an irreducible polynomial with polynomial degree , where is the totient function. Cyclotomic polynomials are returned by the Mathematica command Cyclotomic[n, x]. The roots of cyclotomic polynomials lie on the unit circle in the complex plane, as illustrated above for the first few cyclotomic polynomials.

The first few cyclotomic polynomials are

			(5)
			(6)
			(7)
			(8)
			(9)
			(10)
			(11)
			(12)
			(13)
			(14)

If is an odd prime, then

			(15)
			(16)
			(17)

(Riesel 1994, p. 306). Similarly, for again an odd prime,

			(18)
			(19)
			(20)

For the first few remaining values of ,

			(21)
			(22)
			(23)
			(24)
			(25)
			(26)
			(27)
			(28)

(Riesel 1994, p. 307).

For a prime relatively prime to ,

(29)

but if ,

(30)

(Nagell 1951, p. 160).

An explicit equation for for squarefree is given by

(31)

where is calculated using the recurrence relation

(32)

with , where is the Möbius function and is the greatest common denominator of and .

The polynomial can be factored as

(33)

Furthermore,

(34)

The coefficients of the inverse of the cyclotomic polynomial

			(35)
			(36)

can also be computed from

			(37)
			(38)
			(39)

where is the floor function.

For prime,

(40)

i.e., the coefficients are all 1. The first cyclotomic polynomial to have a coefficient other than and 0 is , which has coefficients of -2 for and . This is true because 105 is the first number to have three distinct odd prime factors, i.e., (McClellan and Rader 1979, Schroeder 1997). The smallest values of for which has one or more coefficients , , , ... are 0, 105, 385, 1365, 1785, 2805, 3135, 6545, 6545, 10465, 10465, 10465, 10465, 10465, 11305, ... (Sloane's A013594).

It appears to be true that, for , if factors, then the factors contain a cyclotomic polynomial. For example,

(41)

This observation has been checked up to (C. Nicol). If and are prime, then is irreducible.

Migotti (1883) showed that coefficients of for and distinct primes can be only 0, . Lam and Leung (1996) considered

(42)

for prime. Write the totient function as

(43)

and let

(44)

then

1. iff for some and ,

2. iff for and ,

3. otherwise .

The number of terms having is , and the number of terms having is . Furthermore, assume , then the middle coefficient of is .

Resultants of cyclotomic polynomials have been computed by Lehmer (1930), Diederichsen (1940), and Apostol (1970). It is known that if , i.e., and are relatively prime (Apostol 1975). Apostol (1975) showed that for positive integers and and arbitrary nonzero complex numbers and ,

(45)

where is the greatest common divisor of and , is the totient function, is the Möbius function, and the product is over the divisors of . If and are distinct primes and , then (◇) simplifies to

(46)

The following table gives the resultants (Sloane's A054372).

	1	2	3	4	5	6	7
1	0
2	2	0
3	3	1	0
4	2	2	1	0
5	5	1	1	1	0
6	1	3	4	1	1	0
7	7	1	1	1	1	1	0

The numbers of 1s in successive rows of this table are given by 0, 0, 1, 1, 3, 3, 5, 4, 6, 7, 9, ... (Sloane's A075795).

The cyclotomic polynomial has the particularly nice Maclaurin series

(47)

whose coefficients 1, 0, -1, -1, 0, 1, 1, 0, -1, -1, ... (Sloane's A010892) are given by solving the recurrence equation

(48)

with (Wolfram 2002, p. 128), giving the explicit form

(49)

Interestingly, any sequence satisfying the linear recurrence equation

(50)

can be written as

(51)