Math 2.0

statement theorem

Gauss–Wantzel theorem

Statement

Let n≥3n \ge 3. The regular nn-gon can be constructed with straightedge and compass if and only if n=2kp1p2⋯ptn = 2^k p_1 p_2 \cdots p_t, with k,t≥0k, t \ge 0 and p1,…,ptp_1, \dots, p_t distinct Fermat primes.

Remarks

A Fermat prime is a prime number of the form 22m+12^{2^m} + 1. The known Fermat primes are 3,5,17,2573, 5, 17, 257 and 6553765537. The regular nn-gon is constructible if and only if e2πi/ne^{2\pi i/n} is a constructible number. Its degree over Q\mathbb{Q} is φ(n)\varphi(n), by the irreducibility of Φn\Phi_n. The condition on nn holds if and only if φ(n)\varphi(n) is a power of 22. So the 1717-gon and the 1515-gon are constructible, but the 77-gon and the 99-gon are not.

History

Carl Friedrich Gauss proved in 1796 that the regular 1717-gon is constructible. In his 1801 book Disquisitiones Arithmeticae, he gave the sufficient condition. Pierre Wantzel gave a full proof of the necessity in 1837.

Explanations

L1 human

The theorem tells exactly which regular polygons you can draw with straightedge and compass. The answer depends on the prime factors of the number of sides. Only Fermat primes, each used at most once, and powers of 22 are allowed.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

Sources

  1. Web https://en.wikipedia.org/wiki/Constructible_polygon, Conditions for constructibility