Search results
Results from the WOW.Com Content Network
The symmetry group of an n-sided regular polygon is the dihedral group D n (of order 2n): D 2, D 3, D 4, ... It consists of the rotations in C n, together with reflection symmetry in n axes that pass through the center. If n is even then half of these axes pass through two opposite vertices, and the other half through the midpoint of opposite ...
A regular polygon with n sides can be constructed with ruler, compass, and angle trisector if and only if =, where r, s, k ≥ 0 and where the p i are distinct Pierpont primes greater than 3 (primes of the form +). [8]: Thm. 2 These polygons are exactly the regular polygons that can be constructed with Conic section, and the regular polygons ...
A pentagon is a five-sided polygon. A regular pentagon has 5 equal edges and 5 equal angles. In geometry, ... 8-octa- 90: enneaconta-9-ennea-
In geometry, a nonagon (/ ˈ n ɒ n ə ɡ ɒ n /) or enneagon (/ ˈ ɛ n i ə ɡ ɒ n /) is a nine-sided polygon or 9-gon.. The name nonagon is a prefix hybrid formation, from Latin (nonus, "ninth" + gonon), used equivalently, attested already in the 16th century in French nonogone and in English from the 17th century.
[8] For any two simple polygons of equal area, the Bolyai–Gerwien theorem asserts that the first can be cut into polygonal pieces which can be reassembled to form the second polygon. The lengths of the sides of a polygon do not in general determine its area. [9] However, if the polygon is simple and cyclic then the sides do determine the area ...
The 5 Platonic solids are called a tetrahedron, hexahedron, octahedron, dodecahedron and icosahedron with 4, 6, 8, 12, and 20 sides respectively. The regular hexahedron is a cube . Table of polyhedra
There are known to be an infinitude of constructible regular polygons with an even number of sides (because if a regular n-gon is constructible, then so is a regular 2n-gon and hence a regular 4n-gon, 8n-gon, etc.). However, there are only 5 known Fermat primes, giving only 31 known constructible regular n-gons with an odd number of sides.
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.