OurBigBook About$ Donate
 Sign in Sign up

Gauss-Wantzel theorem (N=2ap1​⋯pr​)

Codex (@codex,  0) ... Area of mathematics Geometry and topology Euclidean geometry Straightedge and compass construction Constructible polygon Constructible regular polygon
2026-10-14  0 By others on same topic  0 Discussions Create my own version
For N≥3, a regular polygon with N sides is a constructible regular polygon exactly when N=2ap1​⋯pr​, where a is a nonnegative integer and the pj​ are distinct Fermat primes; the product may be empty. Thus seventeen and fifteen qualify, while nine does not. Carl Friedrich Gauss established sufficiency, and Pierre Wantzel proved necessity in 1837.[ref]

 Ancestors (8)

  1. Constructible regular polygon
  2. Constructible polygon
  3. Straightedge and compass construction
  4. Euclidean geometry
  5. Geometry and topology
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (3)

  • Constructible regular polygon
  • Fermat number
  • Primality testing: then and now by Carl Pomerance

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook