Cyclotomic Polynomial Calculator

Minimal poly of e^{2πi/n}

CalculatorsFreeNo Signup
4.8(549 reviews)
All Tools

Loading tool...

About Cyclotomic Polynomial Calculator

A cyclotomic polynomial calculator computing Φ_n(x), the minimal polynomial of primitive nth roots of unity. Degree = φ(n) (Euler totient). Φ_n divides x^n−1 and x^n−1 = Π_{d|n} Φ_d(x). Coefficients are always integers. Client-side.

Cyclotomic Polynomial Calculator Features

  • Φ_n(x) coefficients
  • Degree = φ(n)
  • Factorization
  • Root display
  • Divisor product
Cyclotomic polynomial Φ_n(x): minimal polynomial of primitive nth roots of unity. x^n−1 = Π_{d|n} Φ_d(x). Degree = φ(n). Φ_1=x−1, Φ_2=x+1, Φ_3=x²+x+1, Φ_4=x²+1, Φ_5=x⁴+x³+x²+x+1, Φ_6=x²−x+1.

How to Use

Enter n:

  • Φ_n(x): Coefficients
  • Degree: φ(n)
  • Factorization: x^n−1 = Π Φ_d

Coefficient Mystery

For prime p: Φ_p = x^{p-1}+...+x+1 (all 1s). But Φ_n can have large coefficients! Φ_{105} is the first with a coefficient of −2. The maximum coefficient grows without bound but unpredictably.

Algebraic Significance

Φ_n is irreducible over ℚ (non-trivial!). The splitting field of Φ_n is ℚ(ζ_n) with Galois group (ℤ/nℤ)*. This connects cyclotomic polynomials to class field theory and algebraic number theory.

Step-by-Step Instructions

  1. 1Enter n.
  2. 2Compute Φ_n(x).
  3. 3Check degree = φ(n).
  4. 4See factorization.
  5. 5View roots.

Cyclotomic Polynomial Calculator — Frequently Asked Questions

Why are cyclotomic polynomials important?+

They're the building blocks of x^n−1. Irreducibility over ℚ is deep: Gauss proved it for prime n, the general case uses algebraic number theory. They connect roots of unity to Galois theory, algebraic integers, and even Fermat's Last Theorem.

Can coefficients be large?+

Yes! For prime n: all coefficients are 0 or 1. But Φ_{105}(x) has a coefficient of −2. As n grows with more prime factors, coefficients can be enormous. The growth rate is related to the number of odd prime factors of n.

How do they relate to constructible polygons?+

A regular n-gon is constructible by ruler and compass iff n = 2^a·p₁·p₂·...·p_k where p_i are distinct Fermat primes (3, 5, 17, 257, 65537). This is because Φ_n factors over quadratic extensions iff n has this form.

Share this tool: