Let FF be a , let F‾\overline F be an , and let n≥1n\ge1. An element ζ∈F‾\zeta\in\overline F is a primitive nnth root of unity if its multiplicative order is exactly nn:

ζn=1andζd≠1 for every proper divisor d∣n.\zeta^n=1 \quad\text{and}\quad \zeta^d\ne 1 \text{ for every proper divisor } d\mid n.
Equivalent characterizations

If char⁡(F)∤n\operatorname{char}(F)\nmid n, then ζ\zeta is a primitive nnth root of unity if and only if it is a root of the Φn(x)\Phi_n(x). This characterization can fail after reduction to characteristic dividing nn.

Remarks

When char(F)∤n\mathrm{char}(F)\nmid n, the polynomial xn−1x^n-1 has distinct roots in F‾\overline{F} (a separability phenomenon; compare ), and the nn-th roots of unity form a cyclic subgroup of F‾×\overline{F}^\times. Adjoining a primitive nn-th root produces the F(ζ)/FF(\zeta)/F.

Examples
  1. Complex numbers. In C\mathbb{C}, ζn=e2πi/n\zeta_n=e^{2\pi i/n} is a primitive nn-th root of unity, and all primitive nn-th roots are ζnk\zeta_n^k with gcd⁡(k,n)=1\gcd(k,n)=1.
  1. Small orders. Primitive 3rd roots of unity are the two nontrivial roots of x2+x+1x^2+x+1, namely e2πi/3e^{2\pi i/3} and e4πi/3e^{4\pi i/3}. Primitive 4th roots of unity are ±i\pm i.
  1. Finite fields. If F=FqF=\mathbb{F}_q is a , then F×F^\times is cyclic of order q−1q-1 (see ). Hence FF contains a primitive nn-th root of unity exactly when n∣(q−1)n\mid(q-1).