Difference between revisions of "Cyclotomic polynomial"
(Created Page) |
Duck master (talk | contribs) (Added info about roots and irreducibility, and categorized page) |
||
Line 1: | Line 1: | ||
==Definition== | ==Definition== | ||
− | The cyclotomic polynomials are recursively defined as <math>x^n-1=\ | + | The cyclotomic [[polynomials]] are recursively defined as <math>x^n-1=\prod_{d \vert n} \Phi_n (x)</math>, for <math>n \geq 1</math>. All cyclotomic polynomials are [[irreducible polynomial|irreducible]]. |
+ | |||
+ | ==Roots== | ||
+ | The roots of <math>\Phi_n(x)</math> are <math>e^{\frac{2\pi i d}{n}}</math>, where <math>\gcd(d, n) = 1</math>. For this reason, due to the [[Fundamental Theorem of Algebra]], we have <math>\Phi_n(x) = \prod_{d: \gcd(d, n) = 1} (x - e^{\frac{2\pi i d}{n}})</math>. | ||
==Examples== | ==Examples== | ||
Line 16: | Line 19: | ||
\Phi_8(x)&=x^4+1 \\ | \Phi_8(x)&=x^4+1 \\ | ||
\end{align*}</cmath> | \end{align*}</cmath> | ||
+ | |||
+ | {{stub}} |
Revision as of 00:20, 11 November 2019
Definition
The cyclotomic polynomials are recursively defined as , for . All cyclotomic polynomials are irreducible.
Roots
The roots of are , where . For this reason, due to the Fundamental Theorem of Algebra, we have .
Examples
For a prime , , because for a prime , and so we can factorise to obtain the required result.
The first few cyclotomic polynomials are as shown:
This article is a stub. Help us out by expanding it.