MathLabs

Constructible regular polygons (Gauss–Wantzel)

Solved, 1837GeometryAlgebra
Statement

Determine for which integers n≥3n \ge 3 a regular nn-gon can be constructed in finitely many steps using only an idealized compass and an unmarked straightedge.

Carl Friedrich Gauss discovered the constructibility of the regular 1717-gon on March 30, 1796, and in Section VII of his Disquisitiones Arithmeticae (1801) proved that a regular nn-gon is constructible whenever φ(n)\varphi(n) is a power of 22 — equivalently, when n=2kp1⋯pmn = 2^k p_1 \cdots p_m for distinct Fermat primes pi=22ri+1p_i = 2^{2^{r_i}} + 1. Gauss explicitly stated that this condition is also necessary, and Pierre Laurent Wantzel published the complete proof of necessity in 1837 by showing that constructibility requires the cyclotomic field Q(ζn)\mathbb{Q}(\zeta_n) to have degree φ(n)=2s\varphi(n) = 2^s.

  1. The Gauss–Wantzel theorem: constructible regular polygons via cyclotomic fieldsCarl Friedrich Gauss (sufficiency, 1796/1801); Pierre Laurent Wantzel (necessity, 1837), 1837Difficulty 3/5Undergraduate

References

  1. Carl Friedrich Gauss (1801). Disquisitiones Arithmeticae
  2. Pierre Laurent Wantzel (1837). Recherches sur les moyens de reconnaître si un problème de géométrie peut se résoudre avec la règle et le compas
  3. Andrew M. Gleason (1988). Angle trisection, the heptagon, and the triskaidecagon · DOI:10.1080/00029890.1988.11971989