Search results
Results from the WOW.Com Content Network
In mathematics, a constructible polygon is a regular polygon that can be constructed with compass and straightedge. For example, a regular pentagon is constructible with compass and straightedge while a regular heptagon is not. There are infinitely many constructible polygons, but only 31 with an odd number of sides are known.
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).
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).
Publication by C. F. Gauss in Intelligenzblatt der allgemeinen Literatur-Zeitung. 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]
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.
In terms of algebra, a length is constructible if and only if it represents a constructible number, and an angle is constructible if and only if its cosine is a constructible number. A number is constructible if and only if it can be written using the four basic arithmetic operations and the extraction of square roots but of no higher-order roots.
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.
Not only is 4,294,967,295 the largest known odd number of sides of a constructible polygon, but since constructibility is related to factorization, the list of odd numbers n for which an n-sided polygon is constructible begins with the list of factors of 4,294,967,295. If there are no more Fermat primes, then the two lists are identical.