Search results
Results from the WOW.Com Content Network
F 0 = 3, F 1 = 5, F 2 = 17, F 3 = 257, and F 4 = 65537 (sequence A019434 in the OEIS). Since there are 31 nonempty subsets of the five known Fermat primes, there are 31 known constructible polygons with an odd number of sides. The next twenty-eight Fermat numbers, F 5 through F 32, are known to be composite. [3] Thus a regular n-gon is ...
The regular 257-gon (one with all sides equal and all angles equal) is of interest for being a constructible polygon: that is, it can be constructed using a compass and an unmarked straightedge. This is because 257 is a Fermat prime , being of the form 2 2 n + 1 (in this case n = 3).
If 2 k + 1 is prime and k > 0, then k itself must be a power of 2, [1] so 2 k + 1 is a Fermat number; such primes are called Fermat primes. As of 2023 [update] , the only known Fermat primes are F 0 = 3 , F 1 = 5 , F 2 = 17 , F 3 = 257 , and F 4 = 65537 (sequence A019434 in the OEIS ).
The regular 65537-gon (one with all sides equal and all angles equal) is of interest for being a constructible polygon: that is, it can be constructed using a compass and an unmarked straightedge. This is because 65,537 is a Fermat prime , being of the form 2 2 n + 1 (in this case n = 4).
The square root of 2 is equal to the length of the hypotenuse of a right triangle with legs of length 1 and is therefore a constructible number. In geometry and algebra, a real number is constructible if and only if, given a line segment of unit length, a line segment of length | | can be constructed with compass and straightedge in a finite number of steps.
As 17 is a Fermat prime, the regular heptadecagon is a constructible polygon (that is, one that can be constructed using a compass and unmarked straightedge): this was shown by Carl Friedrich Gauss in 1796 at the age of 19. [1] This proof represented the first progress in regular polygon construction in over 2000 years. [1]
Constructible set (topology), a finite union of locally closed sets; Constructible topology, a topology on the spectrum of a commutative ring y in which every closed set is the image of Spec(B) in Spec(A) for some algebra B over A; Constructible universe, Kurt Gödel's model L of set theory, constructed by transfinite recursion
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.