# Regular polygon

Last updated
Regular polygon
Edges and vertices ${\displaystyle n}$
Schläfli symbol ${\displaystyle \{n\}}$
Coxeter–Dynkin diagram
Symmetry group Dn, order 2n
Dual polygon Self-dual
Area
(with side length ${\displaystyle s}$)
${\displaystyle A={\tfrac {1}{4}}ns^{2}\cot \left({\frac {\pi }{n}}\right)}$
Internal angle ${\displaystyle (n-2)\times {\frac {\pi }{n}}}$
Internal angle sum${\displaystyle \left(n-2\right)\times {\pi }}$
Inscribed circle diameter${\displaystyle d_{\text{IC}}=s\cot \left({\frac {\pi }{n}}\right)}$
Circumscribed circle diameter${\displaystyle d_{\text{OC}}=s\csc \left({\frac {\pi }{n}}\right)}$
Properties Convex, cyclic, equilateral, isogonal, isotoxal

In Euclidean geometry, a regular polygon is a polygon that is direct equiangular (all angles are equal in measure) and equilateral (all sides have the same length). Regular polygons may be either convex , star or skew . In the 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 straight line), if the edge length is fixed.

## General properties

These properties apply to all regular polygons, whether convex or 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 prime factors of n are distinct Fermat primes. See constructible polygon.

A regular n-sided polygon can be constructed with origami if and only if ${\displaystyle n=2^{a}3^{b}p_{1}\cdots p_{r}}$ for some ${\displaystyle r\in \mathbb {N} }$, where each distinct ${\displaystyle p_{i}}$is a Pierpont prime. [1]

### Symmetry

The symmetry group of an n-sided regular polygon is dihedral group Dn (of order 2n): D2, D3, D4, ... It consists of the rotations in Cn, 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 polygons (a simple polygon is one that does not intersect itself anywhere) are convex. Those having the same number of sides are also similar.

An n-sided convex regular polygon is denoted by its Schläfli symbol {n}. For n< 3, we have two degenerate cases:

Monogon {1}
Degenerate in 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 polygon.)
Digon {2}; a "double line segment"
Degenerate in ordinary space. (Some authorities 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.

### Angles

For a regular convex n-gon, each interior angle has a measure of:

${\displaystyle {\frac {180(n-2)}{n}}}$ degrees;
${\displaystyle {\frac {(n-2)\pi }{n}}}$ radians; or
${\displaystyle {\frac {(n-2)}{2n}}}$ full turns,

and each exterior angle (i.e., supplementary to the interior angle) has a measure of ${\displaystyle {\tfrac {360}{n}}}$ 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 increase, 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. For this reason, a circle is not a polygon with an infinite number of sides.

### Diagonals

For n> 2, the number of diagonals is ${\displaystyle {\tfrac {1}{2}}n(n-3)}$; i.e., 0, 2, 5, 9, ..., for a triangle, square, pentagon, hexagon, ... . The diagonals divide the polygon into 1, 4, 11, 24, ... pieces .

For a regular n-gon inscribed in a unit-radius circle, 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 n-gon with circumradius R and distances di from an arbitrary point in the plane to the vertices, we have [2]

${\displaystyle {\frac {1}{n}}\sum _{i=1}^{n}d_{i}^{4}+3R^{4}=\left({\frac {1}{n}}\sum _{i=1}^{n}d_{i}^{2}+R^{2}\right)^{2}.}$

For higher powers of distances ${\displaystyle d_{i}}$ from an arbitrary point in the plane to the vertices of a regular ${\displaystyle n}$-gon, if

${\displaystyle S_{n}^{(2m)}={\frac {1}{n}}\sum _{i=1}^{n}d_{i}^{2m}}$,

then [3]

${\displaystyle S_{n}^{(2m)}=\left(S_{n}^{(2)}\right)^{m}+\sum _{k=1}^{\left\lfloor {\frac {m}{2}}\right\rfloor }{\binom {m}{2k}}{\binom {2k}{k}}R^{2k}\left(S_{n}^{(2)}-R^{2}\right)^{k}\left(S_{n}^{(2)}\right)^{m-2k}}$,

and

${\displaystyle S_{n}^{(2m)}=\left(S_{n}^{(2)}\right)^{m}+\sum _{k=1}^{\left\lfloor {\frac {m}{2}}\right\rfloor }{\frac {1}{2^{k}}}{\binom {m}{2k}}{\binom {2k}{k}}\left(S_{n}^{(4)}-\left(S_{n}^{(2)}\right)^{2}\right)^{k}\left(S_{n}^{(2)}\right)^{m-2k}}$,

where ${\displaystyle m}$ is a positive integer less than ${\displaystyle n}$.

If ${\displaystyle L}$ is the distance from an arbitrary point in the plane to the centroid of a regular ${\displaystyle n}$-gon with circumradius ${\displaystyle R}$, then [3]

${\displaystyle \sum _{i=1}^{n}d_{i}^{2m}=n\left(\left(R^{2}+L^{2}\right)^{m}+\sum _{k=1}^{\left\lfloor {\frac {m}{2}}\right\rfloor }{\binom {m}{2k}}{\binom {2k}{k}}R^{2k}L^{2k}\left(R^{2}+L^{2}\right)^{m-2k}\right)}$,

where ${\displaystyle m}$ = 1, 2, …, ${\displaystyle n-1}$.

#### Interior points

For a regular n-gon, the sum of the perpendicular distances from any interior point to the n sides is n times the apothem [4] :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. [5] [6]

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

${\displaystyle 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)}}}$

For constructible polygons, algebraic expressions for these relationships exist; see 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. [4] :p. 73

The sum of the squared distances from the vertices of a regular n-gon to any point on its circumcircle equals 2nR2 where R is the circumradius. [4] :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 2nR21/4ns2, where s is the side length and R is the circumradius. [4] :p. 73

If ${\displaystyle d_{i}}$ are the distances from the vertices of a regular ${\displaystyle n}$-gon to any point on its circumcircle, then [3]

${\displaystyle 3\left(\sum _{i=1}^{n}d_{i}^{2}\right)^{2}=2n\sum _{i=1}^{n}d_{i}^{4}}$.

### Dissections

Coxeter states that every zonogon (a 2m-gon whose opposite sides are parallel and of equal length) can be dissected into ${\displaystyle {\tbinom {n}{2}}}$ or 1/2m(m − 1) parallelograms. These tilings are contained as subsets of vertices, edges and faces in orthogonal projections m-cubes. [7] 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 gives the number of solutions for smaller polygons.

Example dissections for select even-sided regular polygons
2m 6 8 10 12 14 16 18 20 24 30 4050
Image
Rhombs3610152128364566105190300

### Area

The area A of a convex regular n-sided polygon having side s, circumradius R, apothem a, and perimeter p is given by [8] [9]

${\displaystyle 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)}$

For regular polygons with side s = 1, circumradius R = 1, or apothem a = 1, this produces the following table: [10] (Note that since ${\displaystyle \cot x\rightarrow 1/x}$ as ${\displaystyle x\rightarrow 0}$, the area when ${\displaystyle s=1}$ tends to ${\displaystyle n^{2}/4\pi }$ as ${\displaystyle n}$ grows large.)

Number
of sides
Area when side s = 1Area when circumradius R = 1Area when apothem a = 1
ExactApproximationExactApproximationRelative to
circumcircle area
ExactApproximationRelative to
incircle area
n${\displaystyle {\tfrac {n}{4}}\cot \left({\tfrac {\pi }{n}}\right)}$${\displaystyle {\tfrac {n}{2}}\sin \left({\tfrac {2\pi }{n}}\right)}$${\displaystyle {\tfrac {n}{2\pi }}\sin \left({\tfrac {2\pi }{n}}\right)}$${\displaystyle n\tan \left({\tfrac {\pi }{n}}\right)}$${\displaystyle {\tfrac {n}{\pi }}\tan \left({\tfrac {\pi }{n}}\right)}$
3 ${\displaystyle {\tfrac {\sqrt {3}}{4}}}$0.433012702${\displaystyle {\tfrac {3{\sqrt {3}}}{4}}}$1.2990381050.4134966714${\displaystyle 3{\sqrt {3}}}$5.1961524241.653986686
4 11.00000000022.0000000000.636619772244.0000000001.273239544
5 ${\displaystyle {\tfrac {1}{4}}{\sqrt {25+10{\sqrt {5}}}}}$1.720477401${\displaystyle {\tfrac {5}{4}}{\sqrt {{\tfrac {1}{2}}\left(5+{\sqrt {5}}\right)}}}$2.3776412910.7568267288${\displaystyle 5{\sqrt {5-2{\sqrt {5}}}}}$3.6327126401.156328347
6 ${\displaystyle {\tfrac {3{\sqrt {3}}}{2}}}$2.598076211${\displaystyle {\tfrac {3{\sqrt {3}}}{2}}}$2.5980762110.8269933428${\displaystyle 2{\sqrt {3}}}$3.4641016161.102657791
7 3.6339124442.7364101890.87102641573.3710223331.073029735
8 ${\displaystyle 2+2{\sqrt {2}}}$4.828427125${\displaystyle 2{\sqrt {2}}}$2.8284271250.9003163160${\displaystyle 8\left({\sqrt {2}}-1\right)}$3.3137085001.054786175
9 6.1818241942.8925442440.92072542903.2757321091.042697914
10 ${\displaystyle {\tfrac {5}{2}}{\sqrt {5+2{\sqrt {5}}}}}$7.694208843${\displaystyle {\tfrac {5}{2}}{\sqrt {{\tfrac {1}{2}}\left(5-{\sqrt {5}}\right)}}}$2.9389262620.9354892840${\displaystyle 2{\sqrt {25-10{\sqrt {5}}}}}$3.2491969631.034251515
11 9.3656399072.9735244960.94650224403.2298914231.028106371
12 ${\displaystyle 6+3{\sqrt {3}}}$11.1961524233.0000000000.9549296586${\displaystyle 12\left(2-{\sqrt {3}}\right)}$3.2153903091.023490523
13 13.185768333.0207006170.96151886943.2042122201.019932427
14 15.334501943.0371861750.96676638593.1954086421.017130161
15 [11] 17.64236291 [12] 3.0505248220.9710122088 [13] 3.1883484261.014882824
16 [14] 20.10935797${\displaystyle 4{\sqrt {2-{\sqrt {2}}}}}$3.0614674600.9744953584 [15] 3.1825978781.013052368
17 22.735491903.0705541630.97738774563.1778507521.011541311
18 25.520768193.0781812900.97981553613.1738856531.010279181
19 28.465189433.0846449580.98187298543.1705392381.009213984
20 [16] 31.56875757 [17] 3.0901699440.9836316430 [18] 3.1676888061.008306663
100795.51289883.1395259770.99934215653.1426266051.000329117
1000 79577.209753.1415719830.99999342003.1416029891.000003290
10,000 7957746.8933.1415924480.99999993453.1415927571.000000033
1,000,000 795774715453.1415926541.0000000003.1415926541.000000000

Of all n-gons with a given perimeter, the one with the largest area is regular. [19]

## Constructible polygon

Some regular polygons are easy to construct with compass and straightedge; other regular polygons are not constructible at all. The ancient Greek mathematicians knew how to construct a regular polygon with 3, 4, or 5 sides, [20] :p. xi and they knew how to construct a regular polygon with double the number of sides of a given regular polygon. [20] :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 17-gon in 1796. Five years later, he developed the theory of Gaussian periods 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 primes (including none).

(A Fermat prime is a prime number of the form ${\displaystyle 2^{\left(2^{n}\right)}+1.}$) Gauss stated without proof that this condition was also 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.

## Regular skew polygons

 The cube contains a skew regular hexagon, seen as 6 red edges zig-zagging between two planes perpendicular to the cube's diagonal axis. The zig-zagging side edges of a n-antiprism represent a regular skew 2n-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.

 The Platonic solids (the tetrahedron, cube, octahedron, dodecahedron, and icosahedron) have Petrie polygons, seen in red here, with sides 4, 6, 8, 10, and 10 respectively.

More generally regular skew polygons can be defined in n-space. Examples include the Petrie polygons, 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 apeirogons.

## Regular star polygons

Regular star polygons
2 < 2q < p, gcd(p, q) = 1
 {5/2} {7/2} {7/3}...
Schläfli symbol {p/q}
Vertices and Edges p
Density q
Coxeter diagram
Symmetry group Dihedral (Dp)
Dual polygon Self-dual
Internal angle
(degrees)
${\displaystyle 180-{\frac {360q}{p}}}$ [21]

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:

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}
Two interpretations of {6/2}
Grünbaum
{6/2} or 2{3} [22]
Coxeter
2{3} or {6}[2{3}]{6}
Doubly-wound hexagonHexagram as a compound
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 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 of two triangles, or hexagram.
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}. [23] More compactly Coxeter also writes 2{n/2}, like 2{3} for a hexagram as compound as alternations of regular even-sided polygons, with italics on the leading factor to differentiate it from the coinciding interpretation. [24]
• Many modern geometers, such as Grünbaum (2003), [22] 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 polytopes, 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

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.

## Notes

1. Hwa, Young Lee (2017). Origami-Constructible Numbers (PDF) (MA thesis). University of Georgia. pp. 55–59.
2. Park, Poo-Sung. "Regular polytope distances", Forum Geometricorum 16, 2016, 227-232. http://forumgeom.fau.edu/FG2016volume16/FG201627.pdf
3. Meskhishvili, Mamuka (2020). "Cyclic Averages of Regular Polygons and Platonic Solids". Communications in Mathematics and Applications. 11: 335–355.
4. Johnson, Roger A., Advanced Euclidean Geometry, Dover Publ., 2007 (orig. 1929).
5. Pickover, Clifford A, The Math Book, Sterling, 2009: p. 150
6. Chen, Zhibo, and Liang, Tian. "The converse of Viviani's theorem", The College Mathematics Journal 37(5), 2006, pp. 390–391.
7. Coxeter, Mathematical recreations and Essays, Thirteenth edition, p.141
8. "Math Open Reference" . Retrieved 4 Feb 2014.
9. Results for R = 1 and a = 1 obtained with Maple, using function definition:
f:=proc(n)optionsoperator,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)]]endproc
The expressions for n = 16 are obtained by twice applying the tangent half-angle formula to tan(π/4)
10. ${\displaystyle {\tfrac {15}{8}}\left({\sqrt {15}}+{\sqrt {3}}+{\sqrt {2\left(5+{\sqrt {5}}\right)}}\right)}$
11. ${\displaystyle {\tfrac {15}{16}}\left({\sqrt {15}}+{\sqrt {3}}-{\sqrt {10-2{\sqrt {5}}}}\right)}$
12. ${\displaystyle {\tfrac {15}{2}}\left(3{\sqrt {3}}-{\sqrt {15}}-{\sqrt {2\left(25-11{\sqrt {5}}\right)}}\right)}$
13. ${\displaystyle 4\left(1+{\sqrt {2}}+{\sqrt {2\left(2+{\sqrt {2}}\right)}}\right)}$
14. ${\displaystyle 16\left(1+{\sqrt {2}}\right)\left({\sqrt {2\left(2-{\sqrt {2}}\right)}}-1\right)}$
15. ${\displaystyle 5\left(1+{\sqrt {5}}+{\sqrt {5+2{\sqrt {5}}}}\right)}$
16. ${\displaystyle {\tfrac {5}{2}}\left({\sqrt {5}}-1\right)}$
17. ${\displaystyle 20\left(1+{\sqrt {5}}-{\sqrt {5+2{\sqrt {5}}}}\right)}$
18. Chakerian, G.D. "A Distorted View of Geometry." Ch. 7 in Mathematical Plums (R. Honsberger, editor). Washington, DC: Mathematical Association of America, 1979: 147.
19. Bold, Benjamin. Famous Problems of Geometry and How to Solve Them, Dover Publications, 1982 (orig. 1969).
20. Kappraff, Jay (2002). Beyond measure: a guided tour through nature, myth, and number. World Scientific. p. 258. ISBN   978-981-02-4702-7.
21. Regular polytopes, p.95
22. Coxeter, The Densities of the Regular Polytopes II, 1932, p.53

## Related Research Articles

In geometry, a polygon is a plane figure that is described by a finite number of straight line segments connected to form a closed polygonal chain. The bounded plane region, the bounding circuit, or the two together, may be called a polygon.

In geometry, a Platonic solid is a convex, regular polyhedron in three-dimensional Euclidean space. Being a regular polyhedron means that the faces are congruent regular polygons, and the same number of faces meet at each vertex. There are only five such polyhedra:

In geometry, a hexagon is a six-sided polygon or 6-gon. The total of the internal angles of any simple (non-self-intersecting) hexagon is 720°.

In geometry, an octagon is an eight-sided polygon or 8-gon.

In geometry, a decagon is a ten-sided polygon or 10-gon. The total sum of the interior angles of a simple decagon is 1440°.

In geometry, a diagonal is a line segment joining two vertices of a polygon or polynomy, when those vertices are not on the same edge. Informally, any sloping line is called diagonal. The word diagonal derives from the ancient Greek διαγώνιος diagonios, "from angle to angle" ; it was used by both Strabo and Euclid to refer to a line connecting two vertices of a rhombus or cuboid, and later adopted into Latin as diagonus.

In geometry, a heptagon or septagon is a seven-sided polygon or 7-gon.

In geometry, a dodecagon or 12-gon is any twelve-sided polygon.

In geometry, a triacontagon or 30-gon is a thirty-sided polygon. The sum of any triacontagon's interior angles is 5040 degrees.

In geometry, a pentadecagon or pentakaidecagon or 15-gon is a fifteen-sided polygon.

In geometry, the circumscribed circle or circumcircle of a polygon is a circle that passes through all the vertices of the polygon. The center of this circle is called the circumcenter and its radius is called the circumradius.

In geometry, a pyramid is a polyhedron formed by connecting a polygonal base and a point, called the apex. Each base edge and apex form a triangle, called a lateral face. It is a conic solid with polygonal base. A pyramid with an n-sided base has n + 1 vertices, n + 1 faces, and 2n edges. All pyramids are self-dual.

In mathematics, a hexadecagon is a sixteen-sided polygon.

In geometry, a bicentric polygon is a tangential polygon which is also cyclic — that is, inscribed in an outer circle that passes through each vertex of the polygon. All triangles and all regular polygons are bicentric. On the other hand, a rectangle with unequal sides is not bicentric, because no circle can be tangent to all four sides.

Liu Hui's π algorithm was invented by Liu Hui, a mathematician of the state of Cao Wei. Before his time, the ratio of the circumference of a circle to its diameter was often taken experimentally as three in China, while Zhang Heng (78–139) rendered it as 3.1724 or as . Liu Hui was not satisfied with this value. He commented that it was too large and overshot the mark. Another mathematician Wang Fan (219–257) provided π ≈ 142/45 ≈ 3.156. All these empirical π values were accurate to two digits. Liu Hui was the first Chinese mathematician to provide a rigorous algorithm for calculation of π to any accuracy. Liu Hui's own calculation with a 96-gon provided an accuracy of five digits: π ≈ 3.1416.

In geometry, a pentagon is any five-sided polygon or 5-gon. The sum of the internal angles in a simple pentagon is 540°.

In Euclidean geometry, an orthodiagonal quadrilateral is a quadrilateral in which the diagonals cross at right angles. In other words, it is a four-sided figure in which the line segments between non-adjacent vertices are orthogonal (perpendicular) to each other.

In geometry, a planigon is a convex polygon that can fill the plane with only copies of itself. In the Euclidean plane there are 3 regular planigons; equilateral triangle, squares, and regular hexagons; and 8 semiregular planigons; and 4 demiregular planigons which can tile the plane only with other planigons.

## References

• Lee, Hwa Young; "Origami-Constructible Numbers".
• Coxeter, H.S.M. (1948). "Regular Polytopes". Methuen and Co.{{cite journal}}: Cite journal requires |journal= (help)
• 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. 461–488.
• Poinsot, L.; Memoire sur les polygones et polyèdres. J. de l'École Polytechnique9 (1810), pp. 16–48.
Family An Bn I2(p) / Dn E6 / E7 / E8 / / Hn
Regular polygon Triangle Square p-gon Hexagon Pentagon
Uniform polyhedron Tetrahedron OctahedronCube Demicube DodecahedronIcosahedron
Uniform polychoron Pentachoron 16-cellTesseract Demitesseract 24-cell 120-cell600-cell
Uniform 5-polytope 5-simplex 5-orthoplex5-cube 5-demicube
Uniform 6-polytope 6-simplex 6-orthoplex6-cube 6-demicube 122221
Uniform 7-polytope 7-simplex 7-orthoplex7-cube 7-demicube 132231321
Uniform 8-polytope 8-simplex 8-orthoplex8-cube 8-demicube 142241421
Uniform 9-polytope 9-simplex 9-orthoplex9-cube 9-demicube
Uniform 10-polytope 10-simplex 10-orthoplex10-cube 10-demicube
Uniform n-polytope n-simplex n-orthoplexn-cube n-demicube 1k22k1k21 n-pentagonal polytope
Topics: Polytope familiesRegular polytopeList of regular polytopes and compounds