Cyclotomic polynomial: Difference between revisions
Jump to navigation
Jump to search
imported>Richard Pinch (Examples) |
mNo edit summary |
||
(One intermediate revision by one other user not shown) | |||
Line 1: | Line 1: | ||
{{subpages}} | |||
In [[algebra]], a '''cyclotomic polynomial''' is a [[polynomial]] whose roots are a set of primitive [[root of unity|roots of unity]]. The ''n''-th cyclotomic polynomial, denoted by Φ<sub>''n''</sub> has [[integer]] cofficients. | In [[algebra]], a '''cyclotomic polynomial''' is a [[polynomial]] whose roots are a set of primitive [[root of unity|roots of unity]]. The ''n''-th cyclotomic polynomial, denoted by Φ<sub>''n''</sub> has [[integer]] cofficients. | ||
Line 27: | Line 28: | ||
:<math>\Phi_8(X) = X^4+1 ;\,</math> | :<math>\Phi_8(X) = X^4+1 ;\,</math> | ||
:<math>\Phi_9(X) = X^6+X^3+1 ;\,</math> | :<math>\Phi_9(X) = X^6+X^3+1 ;\,</math> | ||
:<math>\Phi_{10}(X) = X^4-X^3+X^2-X+1. ;\,</math> | :<math>\Phi_{10}(X) = X^4-X^3+X^2-X+1. ;\,</math>[[Category:Suggestion Bot Tag]] |
Latest revision as of 16:01, 3 August 2024
In algebra, a cyclotomic polynomial is a polynomial whose roots are a set of primitive roots of unity. The n-th cyclotomic polynomial, denoted by Φn has integer cofficients.
For a positive integer n, let ζ be a primitive n-th root of unity: then
The degree of is given by the Euler totient function .
Since any n-th root of unity is a primitive d-th root of unity for some factor d of n, we have
By the Möbius inversion formula we have
where μ is the Möbius function.