Search results

...eing the smallest regular polygon that is not [[Neusis construction|neusis constructible]]. ...Neusis construction#Use of the neusis|smallest regular polygon that is not constructible even with neusis]]. ...

...e trisector]].<ref>[http://mathworld.wolfram.com/ConstructiblePolygon.html Constructible Polygon]</ref> As a truncated [[dodecagon]], it can be constructed by an ed In particular this is true for regular polygons with evenly many sides, in which case the parallelograms are all rhombi. Fo ...

...1 (for a(1) to a(31), the 31 regular polygons with an odd number of sides constructible with ruler and compass)}}</ref> Equivalently, it is the largest known odd n ...mely (assuming 65537 is the largest Fermat prime), an odd-sided polygon is constructible if and only if it has 3, 5, 15, 17, 51, 85, 255, 257, 771, 1285, 3855, 4369 ...

...{r|hajja|raynor}} Additionally, it discusses approximate constructions for polygons that cannot be constructed exactly in this way.{{r|hajja}} ...gular polygons that it discusses, for use in origami models that use these polygons as a starting shape instead of the traditional square paper.{{r|raynor}} ...

...regular megagon is not a [[constructible polygon]]. Indeed, it is not even constructible with the use of an angle trisector, as the number of sides is neither a pro The megagon is also used as an illustration of the convergence of regular polygons to a circle.<ref>{{Cite book |last=Russell |first=Bertrand |url=https://boo ...

...s. The [[heptagon]], with seven sides, is the smallest polygon that is not constructible, because it is not a product of Fermat primes.{{r|singmaster}} ...te) and the omission from chapter 7 of any discussion of why classifying [[constructible polygon]]s can be reduced to the case of prime numbers of sides.{{r|singmas ...

== Relation with regular polygons == ...ds in the theory of cyclotomic fields, in connection with the problem of [[Constructible polygon|constructing]] a [[regular polygon|regular {{mvar|n}}-gon]] with a ...

A pentagon may be simple or [[list of self-intersecting polygons|self-intersecting]]. A self-intersecting ''regular pentagon'' (or ''[[star ...1=Meskhishvili |first1=Mamuka |date=2020 |title=Cyclic Averages of Regular Polygons and Platonic Solids |url=https://www.rgnpublications.com/journals/index.php ...

{{short description|1893 book on making polygons with origami}} ...the [[Pythagorean theorem]].{{r|willson}} The book uses high-order regular polygons to provide a geometric calculation of [[pi]].{{r|liebeck|willson}} ...

...on of the problem of [[Constructible polygon|constructibility]] of regular polygons ...

...bn}} Finite cop-win graphs are also called '''dismantlable graphs''' or '''constructible graphs''', because they can be dismantled by repeatedly removing a dominate ...