Ads
related to: regular and irregular polygons explained worksheetstudy.com has been visited by 100K+ users in the past month
Search results
Results From The WOW.Com Content Network
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 non-convex regular polygon is a regular star polygon. The most common example is the pentagram , which has the same vertices as a pentagon , but connects alternating vertices. For an n -sided star polygon, the Schläfli symbol is modified to indicate the density or "starriness" m of the polygon, as { n / m }.
Individual polygons are named (and sometimes classified) according to the number of sides, combining a Greek-derived numerical prefix with the suffix -gon, e.g. pentagon, dodecagon. The triangle, quadrilateral and nonagon are exceptions, although the regular forms trigon, tetragon, and enneagon are sometimes encountered as well.
Polygons have been known since ancient times. The regular polygons were known to the ancient Greeks, with the pentagram, a non-convex regular polygon (star polygon), appearing as early as the 7th century B.C. on a krater by Aristophanes, found at Caere and now in the Capitoline Museum. [40] [41]
Simple polygons are sometimes called Jordan polygons, because they are Jordan curves; the Jordan curve theorem can be used to prove that such a polygon divides the plane into two regions. [8] Indeed, Camille Jordan 's original proof of this theorem took the special case of simple polygons (stated without proof) as its starting point. [ 9 ]
1-uniform tilings include 3 regular tilings, and 8 semiregular ones, with 2 or more types of regular polygon faces. There are 20 2-uniform tilings, 61 3-uniform tilings, 151 4-uniform tilings, 332 5-uniform tilings and 673 6-uniform tilings. Each can be grouped by the number m of distinct vertex figures, which are also called m-Archimedean tilings.