View source for Regular polygon

{{short description|Equiangular and equilateral polygon}}
<div class="skin-invert-image">{{Infobox
| title    = Regular polygon
| above    = {{Image array
|width = 80
|perrow = 3
|image1 = Regular polygon 3 annotated.svg   |alt1 = Regular triangle
|image2 = Regular polygon 4 annotated.svg   |alt2 = Regular square
|image3 = Regular polygon 5 annotated.svg   |alt3 = Regular pentagon
|image4 = Regular polygon 6 annotated.svg   |alt4 = Regular hexagon
|image5 = Regular polygon 7 annotated.svg   |alt5 = Regular heptagon
|image6 = Regular polygon 8 annotated.svg   |alt6 = Regular octagon
|image7 = Regular polygon 9 annotated.svg   |alt7 = Regular nonagon
|image8 = Regular polygon 10 annotated.svg  |alt8 = Regular decagon
|image9 = Regular polygon 11 annotated.svg  |alt9 = Regular hendecagon
|image10 = Regular polygon 12 annotated.svg |alt10 = Regular dodecagon
|image11 = Regular polygon 13 annotated.svg |alt11 = Regular tridecagon
|image12 = Regular polygon 14 annotated.svg |alt12 = Regular tetradecagon
}}

| label1   = [[Edge (geometry)|Edge]]s and [[Vertex (geometry)|vertices]]
|  data1   = <math>n</math>

| label2   = [[Schläfli symbol]]
|  data2   = <math>\{n\}</math>

| label3   = [[Coxeter–Dynkin diagram]]
|  data3   = {{CDD|node_1|n|node}}

| label4   = [[Point group|Symmetry group]]
|  data4   = [[Dihedral symmetry|D<sub>n</sub>]], order 2n

| label5   = [[Dual polygon]]
|  data5   = Self-dual

| label6   = [[Area]]<br /> (with side length <math>s</math>)
|  data6   = <math>A = \tfrac{1}{4}ns^2 \cot\left(\frac{\pi}{n}\right)</math>

| label7   = [[Internal angle]]
|  data7   = <math>(n - 2) \times \frac{{\pi}}{n}</math>

| label8   = Internal angle sum
|  data8   = <math>\left(n - 2\right)\times {\pi}</math>

| label9   = Inscribed circle diameter
|  data9   = <math>d_\text{IC} = s\cot\left(\frac{\pi}{n}\right)</math>

| label10   = Circumscribed circle diameter
|  data10   = <math>d_\text{OC} = s\csc\left(\frac{\pi}{n}\right)</math>

| label11   = Properties
|  data11   = [[Convex polygon|Convex]], [[Cyclic polygon|cyclic]], [[Equilateral polygon|equilateral]], [[isogonal figure|isogonal]], [[isotoxal figure|isotoxal]]
}}</div>

In [[Euclidean geometry]], a '''regular polygon''' is a [[polygon]] that is [[Equiangular polygon|direct equiangular]] (all angles are equal in measure) and [[Equilateral polygon|equilateral]] (all sides have the same length). Regular polygons may be either ''[[convex polygon|convex]]'' or ''[[star polygon|star]]''. In the [[limit (mathematics)|limit]], a sequence of regular polygons with an increasing number of sides approximates a [[circle]], if the [[perimeter]] or [[area]] is fixed, or a regular [[apeirogon]] (effectively a [[Line (geometry)|straight line]]), if the edge length is fixed.

==General properties==
[[File:regular star polygons.svg|class=skin-invert-image|thumb|300px|Regular convex and star polygons with 3 to 12 vertices labelled with their Schläfli symbols]]
These properties apply to all regular polygons, whether convex or [[star polygon|star]]:

*A regular ''n''-sided polygon has [[rotational symmetry]] of order ''n''.

*All vertices of a regular polygon lie on a common circle (the [[circumscribed circle]]); i.e., they are concyclic points. That is, a regular polygon is a [[cyclic polygon]].

*Together with the property of equal-length sides, this implies that every regular polygon also has an inscribed circle or [[incircle]] that is tangent to every side at the midpoint. Thus a regular polygon is a [[tangential polygon]].

*A regular ''n''-sided polygon can be constructed with [[compass and straightedge]] if and only if the [[odd number|odd]] [[prime number|prime]] factors of ''n'' are distinct [[Fermat prime]]s. {{xref|(See [[constructible polygon]].)}}

*A regular ''n''-sided polygon can be constructed with [[origami]] if and only if <math>n = 2^{a} 3^{b} p_1 \cdots p_r</math> for some <math>r \in \mathbb{N}</math>, where each distinct <math>p_i</math> is a [[Pierpont prime]].<ref>{{Cite thesis|last=Hwa|first=Young Lee|date=2017|title=Origami-Constructible Numbers|url=https://getd.libs.uga.edu/pdfs/lee_hwa-young_201712_ma.pdf|type=MA thesis |publisher=University of Georgia|pages=55–59}}</ref>

===Symmetry===
The [[symmetry group]] of an ''n''-sided regular polygon is the [[dihedral group]] D<sub>''n''</sub> (of order 2''n''): D<sub>2</sub>, [[Dihedral group of order 6|D<sub>3</sub>]], D<sub>4</sub>, ... It consists of the rotations in C<sub>''n''</sub>, 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 sides. If ''n'' is odd then all axes pass through a vertex and the midpoint of the opposite side.

==Regular convex polygons==
All regular [[simple polygon]]s (a simple polygon is one that does not intersect itself anywhere) are convex. Those having the same number of sides are also [[Similarity (geometry)|similar]].

An ''n''-sided convex regular polygon is denoted by its [[Schläfli symbol]] <math>\{n\}</math>. For <math>n<3</math>, we have two [[degeneracy (mathematics)|degenerate]] cases:
; [[Monogon]] {1}: Degenerate in [[Euclidean geometry|ordinary space]]. (Most authorities do not regard the monogon as a true polygon, partly because of this, and also because the formulae below do not work, and its structure is not that of any [[abstract polytope|abstract polygon]].)
; [[Digon]] {2}; a "double line segment": Degenerate in [[Euclidean geometry|ordinary space]]. (Some authorities{{weasel inline|date=December 2024}} do not regard the digon as a true polygon because of this.)

In certain contexts all the polygons considered will be regular. In such circumstances it is customary to drop the prefix regular. For instance, all the faces of [[uniform polyhedra]] must be regular and the faces will be described simply as triangle, square, pentagon, etc.
[[File:annuli_with_same_area_around_unit_regular_polygons.svg|class=skin-invert-image|thumb|upright=0.8|As a corollary of the [[annulus (mathematics)|annulus]] chord formula, the&nbsp;area bounded by the [[circumcircle]] and [[incircle]] of every unit convex regular polygon is {{pi}}/4]]

===Angles===
For a regular convex ''n''-gon, each [[interior angle]] has a measure of:
: <math>\frac{180(n - 2)}{n}</math> degrees;
: <math>\frac{(n - 2)\pi}{n}</math> radians; or
: <math>\frac{(n - 2)}{2n}</math> full [[turn (geometry)|turns]],

and each [[exterior angle]] (i.e., [[supplementary angle|supplementary]] to the interior angle) has a measure of <math>\tfrac{360}{n}</math> degrees, with the sum of the exterior angles equal to 360 degrees or 2π radians or one full turn.

As ''n'' approaches infinity, the internal angle approaches 180 degrees. For a regular polygon with 10,000 sides (a [[myriagon]]) the internal angle is 179.964°. As the number of sides increases, the internal angle can come very close to 180°, and the shape of the polygon approaches that of a circle. However the polygon can never become a circle. The value of the internal angle can never become exactly equal to 180°, as the circumference would effectively become a straight line (see [[apeirogon]]). For this reason, a circle is not a polygon with an infinite number of sides.

===Diagonals===
For <math>n>2</math>, the number of [[diagonal]]s is <math>\tfrac{1}{2}n(n - 3)</math>; i.e., 0, 2, 5, 9, ..., for a triangle, square, pentagon, hexagon, ... . The diagonals divide the polygon into 1, 4, 11, 24, ... pieces.{{efn|{{oeis|A007678}}}}

For a regular ''n''-gon inscribed in a circle of radius <math>1</math>, the product of the distances from a given vertex to all other vertices (including adjacent vertices and vertices connected by a diagonal) equals ''n''.

===Points in the plane===

For a regular simple {{mvar|n}}-gon with [[circumradius]] {{mvar|R}} and distances {{mvar|d<sub>i</sub>}} from an arbitrary point in the plane to the vertices, we have<ref>Park, Poo-Sung. "Regular polytope distances", [[Forum Geometricorum]] 16, 2016, 227-232. http://forumgeom.fau.edu/FG2016volume16/FG201627.pdf</ref>

:<math>\frac{1}{n}\sum_{i=1}^n d_i^4 + 3R^4 = \biggl(\frac{1}{n}\sum_{i=1}^n d_i^2 + R^2\biggr)^2.</math>

For higher powers of distances <math>d_i</math> from an arbitrary point in the plane to the vertices of a regular {{mvar|n}}-gon, if

:<math>S^{(2m)}_{n}=\frac 1n\sum_{i=1}^n d_i^{2m}</math>,

then<ref name=Mamuka >{{cite journal| last1= Meskhishvili |first1= Mamuka| date=2020|title=Cyclic Averages of Regular Polygons and Platonic Solids |journal= Communications in Mathematics and Applications|volume=11|pages=335–355|doi= 10.26713/cma.v11i3.1420|doi-broken-date= 24 February 2025|arxiv= 2010.12340|url= https://www.rgnpublications.com/journals/index.php/cma/article/view/1420/1065}}</ref>

:<math>S^{(2m)}_{n} = \left(S^{(2)}_{n}\right)^m + \sum_{k=1}^{\left\lfloor m/2\right\rfloor}\binom{m}{2k}\binom{2k}{k}R^{2k}\left(S^{(2)}_{n} - R^2\right)^k\left(S^{(2)}_{n}\right)^{m-2k}</math>,

and

:<math> S^{(2m)}_{n} = \left(S^{(2)}_{n}\right)^m + \sum_{k=1}^{\left\lfloor m/2\right\rfloor}\frac{1}{2^k}\binom{m}{2k}\binom{2k}{k} \left(S^{(4)}_{n} -\left(S^{(2)}_{n}\right)^2\right)^k\left(S^{(2)}_{n}\right)^{m-2k}</math>,

where {{mvar|m}} is a positive integer less than {{mvar|n}}.

If {{mvar|L}} is the distance from an arbitrary point in the plane to the centroid of a regular {{mvar|n}}-gon with circumradius {{mvar|R}}, then<ref name= Mamuka />

:<math>\sum_{i=1}^n d_i^{2m}=n\left(\left(R^2+L^2\right)^m+ \sum_{k=1}^{\left\lfloor m/2\right\rfloor}\binom{m}{2k}\binom{2k}{k}R^{2k}L^{2k}\left(R^2+L^2\right)^{m-2k}\right)</math>,
where <math>m = 1, 2, \dots, n - 1</math>.

====Interior points====
For a regular {{mvar|n}}-gon, the sum of the perpendicular distances from any interior point to the {{mvar|n}} sides is {{mvar|n}} times the [[apothem]]<ref name=Johnson>Johnson, Roger A., ''Advanced Euclidean Geometry'', Dover Publ., 2007 (orig. 1929).</ref>{{rp|p. 72}} (the apothem being the distance from the center to any side). This is a generalization of [[Viviani's theorem]] for the ''n'' = 3 case.<ref>Pickover, Clifford A, ''The Math Book'', Sterling, 2009: p. 150</ref><ref>Chen, Zhibo, and Liang, Tian. "The converse of Viviani's theorem", ''[[The College Mathematics Journal]]'' 37(5), 2006, pp. 390–391.</ref>

===Circumradius===
[[Image:PolygonParameters.png|class=skin-invert-image|thumb|left|180px|Regular [[pentagon]] (''n'' = 5) with [[edge (geometry)|side]] ''s'', [[circumradius]] ''R'' and [[apothem]] ''a'']]
<div class="skin-invert-image">{{regular polygon side count graph.svg}}</div>
The [[circumradius]] ''R'' from the center of a regular polygon to one of the vertices is related to the side length ''s'' or to the [[apothem]] ''a'' by
:<math>R = \frac{s}{2 \sin\left(\frac{\pi}{n}\right)} = \frac{a}{\cos\left(\frac{\pi}{n} \right)} \quad_,\quad a = \frac{s}{2 \tan\left(\frac{\pi}{n}\right)}</math>

For [[constructible polygon]]s, [[algebraic expression]]s for these relationships exist {{xref|(see {{slink|Bicentric polygon|Regular polygons}})}}.

The sum of the perpendiculars from a regular ''n''-gon's vertices to any line tangent to the circumcircle equals ''n'' times the circumradius.<ref name=Johnson/>{{rp|p. 73}}

The sum of the squared distances from the vertices of a regular ''n''-gon to any point on its circumcircle equals 2''nR''<sup>2</sup> where ''R'' is the circumradius.<ref name=Johnson/>{{rp|p. 73}}

The sum of the squared distances from the midpoints of the sides of a regular ''n''-gon to any point on the circumcircle is 2''nR''<sup>2</sup> − {{sfrac|1|4}}''ns''<sup>2</sup>, where ''s'' is the side length and ''R'' is the circumradius.<ref name=Johnson/>{{rp|p. 73}}
{{Clear|left}}

If <math>d_i</math> are the distances from the vertices of a regular <math>n</math>-gon to any point on its circumcircle, then <ref name= Mamuka />

:<math>3\biggl(\sum_{i=1}^n d_i^2\biggr)^2 = 2n \sum_{i=1}^n d_i^4 </math>.

=== Dissections===
[[Coxeter]] states that every [[zonogon]] (a 2''m''-gon whose opposite sides are parallel and of equal length) can be dissected into <math>\tbinom{m}{2}</math> or {{nowrap|{{sfrac|1|2}}''m''(''m'' − 1)}} parallelograms.
These tilings are contained as subsets of vertices, edges and faces in orthogonal projections [[Hypercube|''m''-cubes]].<ref>[[Coxeter]], Mathematical recreations and Essays, Thirteenth edition, p.141</ref>
In particular, this is true for any regular polygon with an even number of sides, in which case the parallelograms are all rhombi.
The list {{OEIS2C|1=A006245}} gives the number of solutions for smaller polygons.
{| class="wikitable skin-invert-image"
|+ Example dissections for select even-sided regular polygons
!
|[[File:6-gon rhombic dissection.svg  |100px]]
|[[File:8-gon rhombic dissection.svg  |100px]]
|[[File:Sun_decagon.svg               |100px]]
|[[File:12-gon rhombic dissection.svg |100px]]
|[[File:14-gon-dissection-star.svg    |100px]]
|[[File:16-gon rhombic dissection.svg |100px]]
|- align=center valign=top
!scope=row style="text-align:left" |Sides
|[[Hexagon#Dissection|6]]
|[[Octagon#Dissection|8]]
|[[Decagon#Dissection|10]]
|[[Dodecagon#Dissection|12]]
|[[Tetradecagon#Dissection|14]]
|[[Hexadecagon#Dissection|16]]
|- align=center valign=top
!scope=row style="text-align:left" |Rhombs
|3
|6
|10
|15
|21
|28
|- 
|}
{| class="wikitable skin-invert-image"
!
|[[File:18-gon-dissection-star.svg    |100px]]
|[[File:20-gon rhombic dissection.svg |100px]]
|[[File:24-gon rhombic dissection.svg |100px]]
|[[File:30-gon-dissection-star.svg    |100px]]
|[[File:40-gon rhombic dissection.svg |100px]]
|[[File:50-gon-dissection-star.svg    |100px]]
|- align=center valign=top
!scope=row style="text-align:left" |Sides
|[[Octadecagon#Dissection|18]]
|[[Icosagon#Dissection|20]]
|[[Icositetragon#Dissection|24]]
|[[Triacontagon#Dissection|30]]
|40
|50
|- align=center valign=top
!scope=row style="text-align:left" |Rhombs
|36
|45
|66
|105
|190
|300
|}

===Area===<!--This section is linked from [[Truncated icosahedron]]-->
The area ''A'' of a convex regular ''n''-sided polygon having [[Edge (geometry)|side]] ''s'', [[circumscribed circle|circumradius]] ''R'', [[apothem]] ''a'', and [[perimeter]] ''p'' is given by<ref>{{cite web |url=http://www.mathopenref.com/polygonregulararea.html |title=Math Open Reference |access-date=4 Feb 2014}}</ref><ref>{{cite web |url=http://www.mathwords.com/a/area_regular_polygon.htm |title=Mathwords}}</ref>
<math display="block">\begin{align}
A &= \tfrac{1}{2}nsa \\
  &= \tfrac{1}{2}pa \\
  &= \tfrac{1}{4}ns^2\cot\left(\tfrac{\pi}{n}\right) \\
  &= na^2\tan\left(\tfrac{\pi}{n}\right) \\
  &= \tfrac{1}{2}nR^2\sin\left(\tfrac{2\pi}{n}\right)
\end{align}</math>

For regular polygons with side ''s'' = 1, circumradius ''R'' = 1, or apothem ''a'' = 1, this produces the following table:{{efn|1=Results for ''R'' = 1 and ''a'' = 1 obtained with [[Maple (software)|Maple]], using function definition:
<syntaxhighlight lang="maple">
f := proc (n)
options operator, arrow;
[
 [convert(1/4*n*cot(Pi/n), radical), convert(1/4*n*cot(Pi/n), float)],
 [convert(1/2*n*sin(2*Pi/n), radical), convert(1/2*n*sin(2*Pi/n), float), convert(1/2*n*sin(2*Pi/n)/Pi, float)],
 [convert(n*tan(Pi/n), radical), convert(n*tan(Pi/n), float), convert(n*tan(Pi/n)/Pi, float)]
]
end proc
</syntaxhighlight>The expressions for ''n'' = 16 are obtained by twice applying the [[tangent half-angle formula]] to tan(π/4)}} ([[trigonometric functions|Since <math>\scriptstyle \cot x \rightarrow 1/x</math> as <math>\scriptstyle x \rightarrow 0</math>]], the area when <math>\scriptstyle s = 1</math> tends to <math>\scriptstyle n^2/4\pi</math> as <math>\scriptstyle n</math> grows large.)
{{Clear}}
<div style="overflow:auto">
{| class=wikitable style="text-align:center;"
|-
!                            rowspan="2" {{verth|Number<br/>of sides}}
! style="background:#ff9bac" colspan="2" | Area when side ''s'' = 1
! style="background:#6dd7af" colspan="3" | Area when circumradius ''R'' = 1
! style="background:#83c6ff" colspan="3" | Area when apothem ''a'' = 1
|-
! Exact
! Approxi{{shy}}mation
! Exact
! Approxi{{shy}}mation
! Relative to circum{{shy}}circle area
! Exact
! Approxi{{shy}}mation
! Relative to in{{shy}}circle area
|-
| ''n''
| <math>\scriptstyle \tfrac{n}{4}\cot\left(\tfrac{\pi}{n}\right)</math>  ||
| <math>\scriptstyle \tfrac{n}{2}\sin\left(\tfrac{2\pi}{n}\right)</math> || || <math>\scriptstyle \tfrac{n}{2\pi}\sin\left(\tfrac{2\pi}{n}\right)</math>
| <math>\scriptstyle n \tan\left(\tfrac{\pi}{n}\right)</math>            || || <math>\scriptstyle \tfrac{n}{\pi}\tan\left(\tfrac{\pi}{n}\right)</math>
|-
| [[Equilateral triangle|3]]
| {{tmath|\scriptstyle \tfrac{ \sqrt{3} }{4} }} || 0.433012702
| {{tmath|\scriptstyle \tfrac{3\sqrt{3} }{4} }} || 1.299038105 || 0.4134966714
| {{tmath|\scriptstyle        3\sqrt{3}      }} || 5.196152424 || 1.653986686
|-
| [[Square|4]]
| 1 || 1.000000000
| 2 || 2.000000000 || 0.6366197722
| 4 || 4.000000000 || 1.273239544
|-
| [[Regular pentagon|5]]
| {{tmath|\scriptstyle \tfrac{1}{4}\sqrt{25 + 10\sqrt{5} } }}                      || 1.720477401
| {{tmath|\scriptstyle \tfrac{5}{4}\sqrt{\tfrac{1}{2}\left(5 + \sqrt{5}\right)} }} || 2.377641291 || 0.7568267288
| {{tmath|\scriptstyle 5\sqrt{5 - 2\sqrt{5} } }}                                   || 3.632712640 || 1.156328347
|-
| [[Regular hexagon|6]]
| {{tmath|\scriptstyle \tfrac{3\sqrt{3} }{2} }} || 2.598076211
| {{tmath|\scriptstyle \tfrac{3\sqrt{3} }{2} }} || 2.598076211 || 0.8269933428
| {{tmath|\scriptstyle        2\sqrt{3}      }} || 3.464101616 || 1.102657791
|-
| [[Regular heptagon|7]]
|  || 3.633912444
|  || 2.736410189 || 0.8710264157
|  || 3.371022333 || 1.073029735
|-
| [[Regular octagon|8]]
| {{tmath|\scriptstyle   2 + 2\sqrt{2}           }} || 4.828427125
| {{tmath|\scriptstyle       2\sqrt{2}           }} || 2.828427125 || 0.9003163160
| {{tmath|\scriptstyle 8\left(\sqrt{2} - 1\right)}} || 3.313708500 || 1.054786175
|-
| [[Regular enneagon|9]]
|  || 6.181824194
|  || 2.892544244 || 0.9207254290
|  || 3.275732109 || 1.042697914
|-
| [[Regular decagon|10]]
| {{tmath|\scriptstyle \tfrac{5}{2}\sqrt{5 + 2\sqrt{5} } }}                        || 7.694208843
| {{tmath|\scriptstyle \tfrac{5}{2}\sqrt{\tfrac{1}{2}\left(5 - \sqrt{5}\right)} }} || 2.938926262 || 0.9354892840
| {{tmath|\scriptstyle 2\sqrt{25 - 10\sqrt{5} } }}                                 || 3.249196963 || 1.034251515
|-
| [[Regular hendecagon|11]]
|  || 9.365639907
|  || 2.973524496 || 0.9465022440
|  || 3.229891423 || 1.028106371
|-
| [[Regular dodecagon|12]]
| {{tmath|\scriptstyle 6 + 3\sqrt{3} }}               || 11.19615242
| 3                                      || 3.000000000 || 0.9549296586
| {{tmath|\scriptstyle 12\left(2 - \sqrt{3} \right)}} || 3.215390309 || 1.023490523
|-
| [[Regular tridecagon|13]]
|  || 13.18576833
|  || 3.020700617 || 0.9615188694
|  || 3.204212220 || 1.019932427
|-
| [[Regular tetradecagon|14]]
|  || 15.33450194
|  || 3.037186175 || 0.9667663859
|  || 3.195408642 || 1.017130161
|-
| [[Regular pentadecagon|15]]
| {{tmath|\scriptstyle  \tfrac{15}{8}\left(\sqrt{15} + \sqrt{3} + \sqrt{2\left(5 + \sqrt{5} \right)} \right)}}     || 17.64236291
| {{tmath|\scriptstyle  \tfrac{15}{16}\left(\sqrt{15} + \sqrt{3} - \sqrt{10 - 2\sqrt{5} } \right)}}                || 3.050524822 || 0.9710122088
| {{tmath|\scriptstyle  \tfrac{15}{2}\left(3\sqrt{3} - \sqrt{15} - \sqrt{2\left(25 - 11\sqrt{5} \right)} \right)}} || 3.188348426 || 1.014882824
|-
| [[Regular hexadecagon|16]]
| {{tmath|\scriptstyle  4 \left(1 + \sqrt{2} + \sqrt{2 \left(2 + \sqrt{2} \right)} \right)}}               || 20.10935797
| {{tmath|\scriptstyle  4\sqrt{2 - \sqrt{2} } }}                                                                      || 3.061467460 || 0.9744953584
| {{tmath|\scriptstyle  16 \left(1 + \sqrt{2}\right)\left(\sqrt{2 \left(2 - \sqrt{2} \right)} - 1\right)}} || 3.182597878 || 1.013052368
|-
| [[Regular heptadecagon|17]]
|  || 22.73549190
|  || 3.070554163 || 0.9773877456
|  || 3.177850752 || 1.011541311
|-
| [[Regular octadecagon|18]]
|  || 25.52076819
|  || 3.078181290 || 0.9798155361
|  || 3.173885653 || 1.010279181
|-
| [[Regular enneadecagon|19]]
|  || 28.46518943
|  || 3.084644958 || 0.9818729854
|  || 3.170539238 || 1.009213984
|-
| [[Regular icosagon|20]]
| {{tmath|\scriptstyle  5 \left(1 + \sqrt{5} + \sqrt{5 + 2\sqrt{5} } \right) }}    || 31.56875757
| {{tmath|\scriptstyle  \tfrac{5}{2}\left(\sqrt{5} - 1\right)}}                 || 3.090169944 || 0.9836316430
| {{tmath|\scriptstyle  20 \left(1 + \sqrt{5} -\sqrt{5 + 2\sqrt{5} } \right) }} || 3.167688806 || 1.008306663
|-
| 100
|  || 795.5128988
|  || 3.139525977 || 0.9993421565
|  || 3.142626605 || 1.000329117
|-
| [[Regular chiliagon|1000]]
|  || 79577.20975
|  || 3.141571983 || 0.9999934200
|  || 3.141602989 || 1.000003290
|-
| [[Regular myriagon|{{10^|4}}]]
|  || 7957746.893
|  || 3.141592448 || 0.9999999345
|  || 3.141592757 || 1.000000033
|-
| [[Regular megagon|{{10^|6}}]]
|  || 79577471545
|  || 3.141592654 || 1.000000000
|  || 3.141592654 || 1.000000000
|}
</div>

[[File:Polygons comparison.png|thumb|right|400px|Comparison of sizes of regular polygons with the same edge length, from [[equilateral triangle|three]] to [[hexacontagon|sixty]] sides. The size increases without bound as the number of sides approaches infinity.]]
Of all ''n''-gons with a given perimeter, the one with the largest area is regular.<ref>Chakerian, G.D. "A Distorted View of Geometry." Ch. 7 in ''Mathematical Plums'' (R. Honsberger, editor). Washington, DC: Mathematical Association of America, 1979: 147.</ref>

== Constructible polygon==
{{main|Constructible polygon}}

Some regular polygons are easy to [[Compass-and-straightedge construction|construct with compass and straightedge]]; other regular polygons are not constructible at all.
The [[Greek mathematics|ancient Greek mathematicians]] knew how to construct a regular polygon with 3, 4, or 5 sides,<ref name=Bold/>{{rp|p. xi}} and they knew how to construct a regular polygon with double the number of sides of a given regular polygon.<ref name=Bold>Bold, Benjamin. ''Famous Problems of Geometry and How to Solve Them'', Dover Publications, 1982 (orig. 1969).</ref>{{rp|pp. 49–50}} This led to the question being posed: is it possible to construct ''all'' regular ''n''-gons with compass and straightedge? If not, which ''n''-gons are constructible and which are not?

[[Carl Friedrich Gauss]] proved the constructibility of the regular [[heptadecagon|17-gon]] in 1796. Five years later, he developed the theory of [[Gaussian period]]s in his ''[[Disquisitiones Arithmeticae]]''. This theory allowed him to formulate a [[sufficient condition]] for the constructibility of regular polygons:

: A regular ''n''-gon can be constructed with compass and straightedge if ''n'' is the product of a power of 2 and any number of distinct [[Fermat prime]]s (including none).

(A Fermat prime is a [[prime number]] of the form <math>2^{\left(2^n\right)} + 1.</math>) Gauss stated without proof that this condition was also [[necessary condition|necessary]], but never published his proof. A full proof of necessity was given by [[Pierre Wantzel]] in 1837. The result is known as the '''Gauss–Wantzel theorem'''.

Equivalently, a regular ''n''-gon is constructible if and only if the [[cosine]] of its common angle is a [[constructible number]]—that is, can be written in terms of the four basic arithmetic operations and the extraction of square roots.

=={{anchor|Skew regular polygons}}Regular skew polygons==
{|class=wikitable align=right width=400
|- valign=top
|[[File:Cube petrie polygon sideview.svg|160px]]<br>The [[cube]] contains a skew regular [[hexagon]], seen as 6 red edges zig-zagging between two planes perpendicular to the cube's diagonal axis.
|[[File:Antiprism17.jpg|240px]]<br>The zig-zagging side edges of a ''n''-[[antiprism]] represent a regular skew 2''n''-gon, as shown in this 17-gonal antiprism.
|}

A ''regular [[skew polygon]]'' in 3-space can be seen as nonplanar paths zig-zagging between two parallel planes, defined as the side-edges of a uniform [[antiprism]]. All edges and internal angles are equal.
{|class=wikitable width=480
|[[File:Petrie polygons.png|480px]]<br>The [[Platonic solid]]s (the [[tetrahedron]], [[cube]], [[octahedron]], [[dodecahedron]], and [[icosahedron]]) have Petrie polygons, seen in red here, with sides 4, 6, 6, 10, and 10 respectively.
|}

More generally ''regular skew polygons'' can be defined in ''n''-space. Examples include the [[Petrie polygon]]s, polygonal paths of edges that divide a [[regular polytope]] into two halves, and seen as a regular polygon in orthogonal projection.

In the infinite limit ''regular skew polygons'' become skew [[apeirogon]]s.
{{Clear}}

==Regular star polygons==
<div class="skin-invert-image">
{{Infobox
| title            = Regular star polygons
| above            = 2 < 2q < p, [[greatest common divisor|gcd]](p, q) = 1
| abovestyle       = font-size: 14px;
| subheader        = {{image array|perrow=3||width=80
   | image1 = Regular star polygon 5-2.svg | caption1 = [[Pentagram|{5/2}]]
   | image2 = Regular star polygon 7-2.svg | caption2 = [[Heptagram|{7/2}]]
   | image3 = Regular star polygon 7-3.svg | caption3 = [[Heptagram|{7/3}]]
}}
| label1           = [[Schläfli symbol]]
| data1            = {p/q}
| label2           = [[Vertex (geometry)|Vertices]] and [[Edge (geometry)|Edges]]
| data2            = p
| label3           = [[Density (polygon)|Density]]
| data3            = q
| label4           = [[Coxeter diagram]]
| data4            = {{CDD|node_1|p|rat|dq|node}}
| label5           = [[Symmetry group]]
| data5            = [[Dihedral symmetry|Dihedral]] (D<sub>p</sub>)
| label6           = [[Dual polygon]]
| data6            = Self-dual
| label7           = [[Internal angle]]<br>([[degree (angle)|degree]]s)
| data7            = <math>180-\frac{360q}{p}</math><ref>{{cite book |last=Kappraff |first=Jay |title=Beyond measure: a guided tour through nature, myth, and number |publisher=World Scientific |year=2002 |page=258 |isbn= 978-981-02-4702-7 |url=https://books.google.com/books?id=vAfBrK678_kC&q=star+polygon&pg=PA256}}</ref>
}}</div>

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''}. If ''m'' is 2, for example, then every second point is joined. If ''m'' is 3, then every third point is joined. The boundary of the polygon winds around the center ''m'' times.

The (non-degenerate) regular stars of up to 12 sides are:
*[[Pentagram]] – {5/2}
*[[Heptagram]] – {7/2} and {7/3}
*[[Octagram]] – {8/3}
*[[Enneagram (geometry)|Enneagram]] – {9/2} and {9/4}
*[[Decagram (geometry)|Decagram]] – {10/3}
*[[Hendecagram]] – {11/2}, {11/3}, {11/4} and {11/5}
*[[Dodecagram]] – {12/5}

''m'' and ''n'' must be [[coprime]], or the figure will degenerate.

The degenerate regular stars of up to 12 sides are:
*Tetragon – {4/2}
*Hexagons – {6/2}, {6/3}
*Octagons – {8/2}, {8/4}
*Enneagon – {9/3}
*Decagons – {10/2}, {10/4}, and {10/5}
*Dodecagons – {12/2}, {12/3}, {12/4}, and {12/6}

{| class="wikitable floatright skin-invert-image"
|+ Two interpretations of {6/2}
! Grünbaum<br>{6/2} or 2{3}<ref name=Branko>[http://www.math.washington.edu/~grunbaum/Your%20polyhedra-my%20polyhedra.pdf Are Your Polyhedra the Same as My Polyhedra?] [[Branko Grünbaum]] (2003), Fig. 3</ref>
! Coxeter<br>''2''{3} or {6}[2{3}]{6}
|-
| [[File:Doubly wound hexagon.svg|160px]]
| [[File:Regular star figure 2(3,1).svg|160px]]
|-
! Doubly-wound hexagon
! Hexagram as a compound<br>of two triangles
|}
Depending on the precise derivation of the Schläfli symbol, opinions differ as to the nature of the degenerate figure. For example, {6/2} may be treated in either of two ways:
* For much of the 20th century (see for example {{harvtxt|Coxeter|1948}}), we have commonly taken the /2 to indicate joining each vertex of a convex {6} to its near neighbors two steps away, to obtain the regular [[compound polygon|compound]] of two triangles, or [[hexagram]]. {{paragraph}}Coxeter clarifies this regular compound with a notation {kp}[k{p}]{kp} for the compound {p/k}, so the [[hexagram]] is represented as {6}[2{3}]{6}.<ref>Regular polytopes, p.95</ref> More compactly Coxeter also writes ''2''{n/2}, like ''2''{3} for a hexagram as compound as [[Alternation (geometry)|alternations]] of regular even-sided polygons, with italics on the leading factor to differentiate it from the coinciding interpretation.<ref>Coxeter, The Densities of the Regular Polytopes II, 1932, p.53</ref>
* Many modern geometers, such as Grünbaum (2003),<ref name=Branko/> regard this as incorrect. They take the /2 to indicate moving two places around the {6} at each step, obtaining a "double-wound" triangle that has two vertices superimposed at each corner point and two edges along each line segment. Not only does this fit in better with modern theories of [[abstract polytope]]s, but it also more closely copies the way in which Poinsot (1809) created his star polygons – by taking a single length of wire and bending it at successive points through the same angle until the figure closed.

==Duality of regular polygons ==
{{Expand section|date=December 2024}}
{{see also|Self-dual polyhedra}}
All regular polygons are self-dual to congruency, and for odd ''n'' they are self-dual to identity.

In addition, the regular star figures (compounds), being composed of regular polygons, are also self-dual.

==Regular polygons as faces of polyhedra==
A [[uniform polyhedron]] has regular polygons as faces, such that for every two vertices there is an [[isometry]] mapping one into the other (just as there is for a regular polygon).

A [[quasiregular polyhedron]] is a uniform polyhedron which has just two kinds of face alternating around each vertex.

A [[regular polyhedron]] is a uniform polyhedron which has just one kind of face.

The remaining (non-uniform) [[convex polyhedra]] with regular faces are known as the [[Johnson solids]].

A polyhedron having regular triangles as faces is called a [[deltahedron]].

==See also==
*[[Euclidean tilings by convex regular polygons]]
*[[Platonic solid]]
*[[List of regular polytopes and compounds]]
*[[Equilateral polygon]]
*[[Carlyle circle]]

==Notes==
{{notelist}}

==References==
{{reflist}}

==Further reading==
*Lee, Hwa Young; "Origami-Constructible Numbers".
*{{Cite book |author-link=Coxeter |first=H.S.M. |last=Coxeter |title=[[Regular Polytopes]] |publisher=Methuen and Co. |year=1948 }}
*Grünbaum, B.; Are your polyhedra the same as my polyhedra?, ''Discrete and comput. geom: the Goodman-Pollack festschrift'', Ed. Aronov et al., Springer (2003), pp.&nbsp;461–488.
*[[Louis Poinsot|Poinsot, L.]]; Memoire sur les polygones et polyèdres. ''J. de l'École Polytechnique'' '''9''' (1810), pp.&nbsp;16–48.

==External links==
*{{mathworld |urlname=RegularPolygon |title=Regular polygon}}
*[http://www.mathopenref.com/polygonregular.html Regular Polygon description] With interactive animation
*[http://www.mathopenref.com/polygonincircle.html Incircle of a Regular Polygon] With interactive animation
*[http://www.mathopenref.com/polygonregulararea.html Area of a Regular Polygon] Three different formulae, with interactive animation
*[http://mathdl.maa.org/convergence/1/?pa=content&sa=viewDocument&nodeId=1056&bodyId=1245 Renaissance artists' constructions of regular polygons] at [http://mathdl.maa.org/convergence/1/ Convergence]

{{Polygons}}
{{Polytopes}}
{{Ancient Greek mathematics}}

{{DEFAULTSORT:Regular Polygon}}
[[Category:Types of polygons]]
[[Category:Regular polytopes]]