Here is a list of articles in the Constructible polygons category of the Computing portal that unifies foundations of mathematics and computations using computers. Articles related to constructible regular polygons, i.e. those amenable to compass and straightedge construction. Carl Friedrich Gauss proved that a regular polygon is constructible if its number of sides has no odd prime factors that are not Fermat primes, and no odd prime factors that are raised to a power of 2 or higher.
Pages in category "Constructible polygons"
The following 30 pages are in this category, out of 30 total.
- Constructible polygon (computing)
- 120-gon (computing)
- 257-gon (computing)
- 4,294,967,295 (computing)
- 65537-gon (computing)
- Carlyle circle (computing)
- Fermat number (computing)
- Square (computing)
- Pierre Wantzel (biography)