info prev up next book cdrom email home


A closed plane figure with $n$ sides. If all sides and angles are equivalent, the polygon is called regular. Regular polygons can be Convex or Star. The word derives from the Greek poly (many) and gonu (knee).

The Area of a Convex Polygon with Vertices $(x_1, y_1)$, ..., $(x_n, y_n)$ is

A={1\over 2}\left({\left\vert\matrix{x_1 & x_2\cr y_1 & y_2\...
...eft\vert\matrix{x_n & x_1\cr y_n & y_1\cr}\right\vert}\right),
\end{displaymath} (1)

which can be written

A={\textstyle{1\over 2}}(x_1y_2-x_2y_1+x_2y_3-x_3y_2+\ldots+x_{n-1}y_n-x_ny_{n-1}+x_ny_1-x_1y_n),
\end{displaymath} (2)

where the signs can be found from the following diagram.

\begin{figure}\begin{center}\BoxedEPSF{PolygonArea.epsf scaled 1000}\end{center}\end{figure}

The Area of a polygon is defined to be Positive if the points are arranged in a counterclockwise order, and Negative if they are in clockwise order (Beyer 1987).

\begin{figure}\begin{center}\BoxedEPSF{PolygonalAngles.epsf scaled 1000}\end{center}\end{figure}

The sum $I$ of internal angles in the above diagram of a dissected polygon is

\end{displaymath} (3)

\sum_{i=1}^n \gamma_i=360^\circ
\end{displaymath} (4)

and the sum of Angles of the $n$ Triangles is
\sum_{i=1}^n(\alpha_i+\beta_i+\gamma_i)=\sum_{i=1}^n (180^\circ)=n(180^\circ).
\end{displaymath} (5)

\end{displaymath} (6)

Let $n$ be the number of sides. The regular $n$-gon is then denoted $\{n\}$.

$n$ $\{n\}$
2 Digon
3 Equilateral Triangle (Trigon)
4 Square (Quadrilateral, Tetragon)
5 Pentagon
6 Hexagon
7 Heptagon
8 Octagon
9 Nonagon (Enneagon)
10 Decagon
11 Undecagon (Hendecagon)
12 Dodecagon
13 Tridecagon (Triskaidecagon)
14 Tetradecagon (Tetrakaidecagon)
15 Pentadecagon (Pentakaidecagon)
16 Hexadecagon (Hexakaidecagon)
17 Heptadecagon (Heptakaidecagon)
18 Octadecagon (Octakaidecagon)
19 Enneadecagon (Enneakaidecagon)
20 Icosagon
30 Triacontagon
40 Tetracontagon
50 Pentacontagon
60 Hexacontagon
70 Heptacontagon
80 Octacontagon
90 Enneacontagon
100 Hectogon
10000 Myriagon


Let $s$ be the side length, $r$ be the Inradius, and $R$ the Circumradius. Then

$\displaystyle s$ $\textstyle =$ $\displaystyle 2r\tan\left({\pi\over n}\right)= 2R\sin\left({\pi\over n}\right)$ (7)
$\displaystyle r$ $\textstyle =$ $\displaystyle {\textstyle{1\over 2}}s\cot\left({\pi\over n}\right)$ (8)
$\displaystyle R$ $\textstyle =$ $\displaystyle {\textstyle{1\over 2}}s\csc\left({\pi\over n}\right)$ (9)
$\displaystyle A$ $\textstyle =$ $\displaystyle {\textstyle{1\over 4}}ns^2\cot\left({\pi\over n}\right)$ (10)
  $\textstyle =$ $\displaystyle nr^2\tan\left({\pi\over n}\right)$ (11)
  $\textstyle =$ $\displaystyle {\textstyle{1\over 2}}nR^2\sin\left({2\pi\over n}\right).$ (12)

If the number of sides is doubled, then
$\displaystyle s_{2n}$ $\textstyle =$ $\displaystyle \sqrt{2R^2-R\sqrt{4R^2-{s_n}^2}}$ (13)
$\displaystyle A_{2n}$ $\textstyle =$ $\displaystyle {4rA_n\over 2r+\sqrt{4r^2+{s_n}^2}}.$ (14)

Furthermore, if $p_k$ and $P_k$ are the Perimeters of the regular polygons inscribed in and circumscribed around a given Circle and $a_k$ and $A_k$ their areas, then
$\displaystyle P_{2n}$ $\textstyle =$ $\displaystyle {2p_nP_n\over p_n+P_n}$ (15)
$\displaystyle p_{2n}$ $\textstyle =$ $\displaystyle \sqrt{p_nP_{2n}},$ (16)

$\displaystyle a_{2n}$ $\textstyle =$ $\displaystyle \sqrt{a_nA_n}$ (17)
$\displaystyle A_{2n}$ $\textstyle =$ $\displaystyle {2a_{2n}A_n\over a_{2n}+A_n}$ (18)

(Beyer 1987, p. 125).

Compass and Straightedge constructions dating back to Euclid were capable of inscribing regular polygons of 3, 4, 5, 6, 8, 10, 12, 16, 20, 24, 32, 40, 48, 64, ..., sides. However, this listing is not a complete enumeration of ``constructible'' polygons. In fact, a regular $n$-gon is constructible only if $\phi(n)$ is a Power of 2, where $\phi$ is the Totient Function (this is a Necessary but not Sufficient condition). More specifically, a regular $n$-gon ($n\geq 3$) can be constructed by Straightedge and Compass (i.e., can have trigonometric functions of its Angles expressed in terms of finite Square Root extractions) Iff

n=2^k p_1p_2\cdots p_s,
\end{displaymath} (19)

where $k$ is in Integer $\geq 0$ and the $p_i$ are distinct Fermat Primes. Fermat Numbers are of the form
\end{displaymath} (20)

where $m$ is an Integer $\geq 0$. The only known Primes of this form are 3, 5, 17, 257, and 65537.

The fact that this condition was Sufficient was first proved by Gauß in 1796 when he was 19 years old, and it relies on the property of Irreducible Polynomials that Roots composed of a finite number of Square Root extractions exist only if the order of the equation is of the form $2^h$. That this condition was also Necessary was not explicitly proven by Gauss, and the first proof of this fact is credited to Wantzel (1836).

Constructible values of $n$ for $n<300$ were given by Gauss (Smith 1994), and the first few are 2, 3, 4, 5, 6, 8, 10, 12, 15, 16, 17, 20, 24, 30, 32, 34, 40, 48, 51, 60, 64, 68, 80, 85, 96, 102, 120, 128, 136, 160, 170, 192, ... (Sloane's A003401). Gardner (1977) and independently Watkins (Conway and Guy 1996) noticed that the number of sides for constructible polygons with an Odd number of sides is given by the first 32 rows of Pascal's Triangle (mod 2) interpreted as Binary numbers, giving 1, 3, 5, 15, 17, 51, 85, 255, ... (Sloane's A004729, Conway and Guy 1996, p. 140).


Although constructions for the regular Triangle, Square, Pentagon, and their derivatives had been given by Euclid, constructions based on the Fermat Primes $\geq 17$ were unknown to the ancients. The first explicit construction of a Heptadecagon (17-gon) was given by Erchinger in about 1800. Richelot and Schwendenwein found constructions for the 257-gon in 1832, and Hermes spent 10 years on the construction of the 65537-gon at Göttingen around 1900 (Coxeter 1969). Constructions for the Equilateral Triangle and Square are trivial (top figures below). Elegant constructions for the Pentagon and Heptadecagon are due to Richmond (1893) (bottom figures below).

\begin{figure}\begin{center}\BoxedEPSF{PolygonConstruction.epsf scaled 700}\end{center}\end{figure}

Given a point, a Circle may be constructed of any desired Radius, and a Diameter drawn through the center. Call the center $O$, and the right end of the Diameter $P_0$. The Diameter Perpendicular to the original Diameter may be constructed by finding the Perpendicular Bisector. Call the upper endpoint of this Perpendicular Diameter $B$. For the Pentagon, find the Midpoint of $OB$ and call it $D$. Draw $DP_0$, and Bisect $\angle ODP_0$, calling the intersection point with $OP_0$ $N_1$. Draw $N_1P_1$ Parallel to $OB$, and the first two points of the Pentagon are $P_0$ and $P_1$. The construction for the Heptadecagon is more complicated, but can be accomplished in 17 relatively simple steps. The construction problem has now been automated (Bishop 1978).

See also 257-gon, 65537-gon, Anthropomorphic Polygon, Bicentric Polygon, Carnot's Polygon Theorem, Chaos Game, Convex Polygon, Cyclic Polygon, de Moivre Number, Diagonal (Polygon), Equilateral Triangle, Euler's Polygon Division Problem, Heptadecagon, Hexagon, Hexagram, Illumination Problem, Jordan Polygon, Lozenge, Octagon, Parallelogram, Pascal's Theorem, Pentagon, Pentagram, Petrie Polygon, Polygon Circumscribing Constant, Polygon Inscribing Constant, Polygonal Knot, Polygonal Number, Polygonal Spiral, Polygon Triangulation, Polygram, Polyhedral Formula, Polyhedron, Polytope, Quadrangle, Quadrilateral, Regular Polygon, Reuleaux Polygon, Rhombus, Rotor, Simple Polygon, Simplicity, Square, Star Polygon, Trapezium, Trapezoid, Triangle, Visibility, Voronoi Polygon, Wallace-Bolyai-Gerwein Theorem


Beyer, W. H. CRC Standard Mathematical Tables, 28th ed. Boca Raton, FL: CRC Press, pp. 124-125 and 196, 1987.

Bishop, W. ``How to Construct a Regular Polygon.'' Amer. Math. Monthly 85, 186-188, 1978.

Conway, J. H. and Guy, R. K. The Book of Numbers. New York: Springer-Verlag, pp. 140 and 197-202, 1996.

Courant, R. and Robbins, H. ``Regular Polygons.'' §3.2 in What is Mathematics?: An Elementary Approach to Ideas and Methods, 2nd ed. Oxford, England: Oxford University Press, pp. 122-125, 1996.

Coxeter, H. S.M. Introduction to Geometry, 2nd ed. New York: Wiley, 1969.

De Temple, D. W. ``Carlyle Circles and the Lemoine Simplicity of Polygonal Constructions.'' Amer. Math. Monthly 98, 97-108, 1991.

Gardner, M. Mathematical Carnival: A New Round-Up of Tantalizers and Puzzles from Scientific American. New York: Vintage Books, p. 207, 1977.

Gauss, C. F. §365 and 366 in Disquisitiones Arithmeticae. Leipzig, Germany, 1801. Translated by A. A Clarke. New Haven, CT: Yale University Press, 1965.

The Math Forum. ``Naming Polygons and Polyhedra.''

Rawles, B. Sacred Geometry Design Sourcebook: Universal Dimensional Patterns. Nevada City, CA: Elysian Pub., p. 238, 1997.

Richmond, H. W. ``A Construction for a Regular Polygon of Seventeen Sides.'' Quart. J. Pure Appl. Math. 26, 206-207, 1893.

Sloane, N. J. A. Sequences A004729 and A003401/M0505 in ``An On-Line Version of the Encyclopedia of Integer Sequences.'' and Sloane, N. J. A. and Plouffe, S. The Encyclopedia of Integer Sequences. San Diego: Academic Press, 1995.

Smith, D. E. A Source Book in Mathematics. New York: Dover, p. 350, 1994.

Tietze, H. Ch. 9 in Famous Problems of Mathematics. New York: Graylock Press, 1965.

Wantzel, M. L. ``Recherches sur les moyens de reconnaître si un Problème de Géométrie peut se résoudre avec la règle et le compas.'' J. Math. pures appliq. 1, 366-372, 1836.

info prev up next book cdrom email home

© 1996-9 Eric W. Weisstein