## You are here

Homecriterion for constructibility of regular polygon

## Primary tabs

# criterion for constructibility of regular polygon

###### Theorem 1.

Let $n$ be an integer with $n\geq 3$. Then a regular $n$-gon is constructible if and only if a primitive $n$th root of unity is a constructible number.

###### Proof.

First of all, note that a primitive $n$th root of unity is a constructible number if and only if $\displaystyle\cos\left(\frac{2\pi}{n}\right)+i\sin\left(\frac{2\pi}{n}\right)$ is a constructible number. See the entry on roots of unity for more details. Therefore, without loss of generality, only the constructibility of the number $\displaystyle\cos\left(\frac{2\pi}{n}\right)+i\sin\left(\frac{2\pi}{n}\right)$ will be considered.

Sufficiency: If a regular $n$-gon is constructible, then so is the angle whose vertex is the center of the polygon and whose rays pass through adjacent vertices of the polygon. The measure of this angle is $\displaystyle\frac{2\pi}{n}$.

By the theorem on constructible angles, $\displaystyle\sin\left(\frac{2\pi}{n}\right)$ and $\displaystyle\cos\left(\frac{2\pi}{n}\right)$ are constructible numbers. Note that $i$ is also a constructible number. Thus, $\displaystyle\cos\left(\frac{2\pi}{n}\right)+i\sin\left(\frac{2\pi}{n}\right)$ is a constructible number.

Necessity: If $\displaystyle\omega=\cos\left(\frac{2\pi}{n}\right)+i\sin\left(\frac{2\pi}{n}\right)$ is a constructible number, then so is $\omega^{m}$ for any integer $m$.

On the complex plane, for every integer $m$ with $0\leq m<n$, construct the point corresponding to $\omega^{m}$. Use line segments to connect the points corresponding to $\omega^{m}$ and $\omega^{{m+1}}$ for every integer $m$ with $0\leq m<n$. (Note that $\omega^{0}=1=\omega^{n}$.) This forms a regular $n$-gon. ∎

## Mathematics Subject Classification

51M15*no label found*12D15

*no label found*

- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)

- Other useful stuff

## Recent Activity

new question: Prime numbers out of sequence by Rubens373

Oct 7

new question: Lorenz system by David Bankom

Oct 19

new correction: examples and OEIS sequences by fizzie

Oct 13

new correction: Define Galois correspondence by porton

Oct 7

new correction: Closure properties on languages: DCFL not closed under reversal by babou

new correction: DCFLs are not closed under reversal by petey

Oct 2

new correction: Many corrections by Smarandache

Sep 28

new question: how to contest an entry? by zorba

new question: simple question by parag