The Central Result
This is the concluding post in this series and we aim to prove the following result (proved in part by Gauss and finally the converse by Wantzel):A regular polygon of n,n>2 sides can be constructed by Euclidean tools if and only if ϕ(n)=2k.
Here ϕ(n) denotes the Euler's Totient function. It is clear that a regular polygon of n sides can be constructed if and only if cos(2π/n) is constructible. To do so we find the minimal polynomial of ξ=2cos(2π/n). We have already established that the minimal polynomial of ζ=cos(2π/n)+isin(2π/n) is the nth cyclotomic polynomial Φn(z).
We also have ξ=ζ+ζ−1 and we need to note that ζ−1 is a root of Φn(z)=0 so that the polynomial zϕ(n)Φn(1/z) is the same as Φn(z). Since n>2 we see that ϕ(n) is even and we can write ϕ(n)=2m.
It therefore follows we can express z−mΦn(z) can be expressed in the form (zm+z−m)+a1(zm−1+z−(m−1))+⋯+am−1(z+z−1)+am where the ai are integers. Since zk+z−k=(z+z−1)(zk−1+z−(k−1))−(zk−2+z−(k−2)) we can express z−mΦn(z) as a polynomial in (z+z−1) of degree m with integral coefficients only and moreover this polynomial will be monic. Let this polynomial be called Ψm(z). Then Φn(z)=zmΨm(z+z−1).
From this relation it follows that Ψm(z) is irreducible over rationals. For if it were not, we could write Ψm(z)=f(z)g(z) where f(z) is of degree r<m. Therefore Φn(z)=zmΨm(z+z−1)=zmf(z+z−1)g(z+z−1)={zrf(z+z−1)}{zm−rg(z+z−1)} which leads to a contradiction as Φn(z) is irreducible.
It is thus established that Ψm(z) is the minimal polynomial of degree m=ϕ(n)/2 for ξ. And therefore ξ=2cos(2π/n) is constructible only if m=ϕ(n)/2 is a power of 2 i.e. when ϕ(n) is a power of 2.
Therefore we have established the "only if" part of the main result. We now would like to establish the "if" part. To proceed we need to observe that ϕ(n)=2k if and only if n=2lp1p2…pm where pi are distinct Fermat primes. If n if of the form above then it is easily seen that ϕ(n) is a power of 2. On the other hand if n has the prime factorization n=pk00pk11pk22…pkmm then ϕ(n)=pk0−10pk1−11…pkm−1m(p0−1)(p1−1)…(pm−1) and it is clear that ϕ(n) will be a power of 2 only when one of the primes pi is 2 and the exponents of other primes is 1 and for those primes (pi−1) is a power of 2. Thus we must have n in the desired form to have ϕ(n) a power of 2.
In the expression of n we can obviously ignore the factor 2l because as we have seen, if a polygon of n sides can be constructed by Euclidean tools then a polygon of 2n sides can also be so constructed. So we can assume that n is a product of distinct Fermat primes. We now prove the following result:
If a regular polygon of m sides and a regular polygon of n sides can be constructed by Euclidean tools, and m is coprime to n then a regular polygon of mn sides can also be constructed using Euclidean tools.
Proof: Since m is coprime to n, we have integers a,b such that am+bn=1 and then we get an+bm=1mn⇒a⋅2πn+b⋅2πm=2πmn Since we can construct angles 2π/m and 2π/n using Euclidean tools, we can therefore construct angle 2π/(mn) in this fashion and therefore a regular polygon of mn sides is constructible using Euclidean tools only.
In the previous post we had established that if p is a Fermat prime then a regular polygon of p sides is constructible using Euclidean tools. It now follows that if n is a product of distinct Fermat primes then a regular polygon of n sides is constructible using Euclidean tools.
Therefore we have established the main result concerning the construction of regular polygons. Its now time to show the construction of a regular polygon of 17 sides.
Construction of Regular Polygon of 17 Sides
We will solve the equation Φ17(z)=1+z+z2+⋯+z16=0 using the concept of Gaussian periods. Let α=2π/17 so that ζ=cosα+isinα is a root of the above cyclotomic equation. Since 3 is a primitive root of 17, we arrange ζk in the form ζm=ζ3m. The correspondence between m and k is as follows: m0123456789101112131415k13910135151116148741226 The periods of 8 terms are given by x1=∑mevenζm=ζ1+ζ9+ζ13+ζ15+ζ16+ζ8+ζ4+ζ2x2=∑moddζm=ζ3+ζ10+ζ5+ζ11+ζ14+ζ7+ζ12+ζ6 and periods of 4 terms are given by y1=∑m≡0(mod4)ζm=ζ1+ζ13+ζ16+ζ4y2=∑m≡2(mod4)ζm=ζ9+ζ15+ζ8+ζ2y3=∑m≡1(mod4)ζm=ζ3+ζ5+ζ14+ζ12y4=∑m≡3(mod4)ζm=ζ10+ζ11+ζ7+ζ6 Since ζk+ζ17−k=2coskα, we get x1=2(cosα+cos8α+cos4α+cos2α)x2=2(cos3α+cos7α+cos5α+cos6α)y1=2(cosα+cos4α)y2=2(cos8α+cos2α)y3=2(cos3α+cos5α)y4=2(cos7α+cos6α) Clearly x1+x2=−1 (sum of roots) and if we multiply we will find that x1x2=4(x1+x2)=−4 so that x1,x2 are roots of the equation x2+x−4=0 where x1>x2 (check this yourself). Again by multiplying we get y1y2=−1 and since y1+y2=x1, so that y1,y2 are roots of y2−x1y−1=0 where y1>y2. Similarly y3,y4 are roots of y2−x2y−1=0 and y3>y4.Two periods of 2 terms are z1=2cosα and z2=2cos4α and then we have z1+z2=y1,z1z2=y3 so that z1,z2 are roots of equation z2−y1z+y3=0 and z1>z2.
Solving the above equations and taking care of the inequalities involved we can see that z1 is given by the somewhat cumbersome expression 2cos(2π17)=−1+√17+√34−2√17+2√17+3√17−√34−2√17−2√34+2√178 We should also note that the inequalities which differentiate the above roots are obtained using non-algebraic means. Therefore obtaining an expression of 2cos(2π/17) is not entirely an algebraic problem. In fact, from the view point of algebra, all the roots of Ψ8(z)=0 are interchangeable.
We now show the construction of a regular polygon of 17 sides graphically and then explain the steps.

Fig 1. Construction of Regular 17-gon
We start with a circle and two perpendicular radii OA and OB. Then a point C is found on OB such that OC=OB/4. Another point D on OA is found such that ∠OCA=4∠OCD. A point E is located on OA extended towards O such that ∠DCE=π/4. A semicircle with AE as diameter is drawn which intersects OB in F. A circle is drawn with center D and radius DF which intersects OA in G and H. Perpendiculars to OA are drawn from points G and H which meet the initial circle (with center O and radius OA) at points P3 and P5. Bisecting the arc P3P5 we get P4. Now P3P4 is the side of the desired regular polygon and the construction can be completed easily by cutting arcs of that length starting from point A=P0.
The reason the above construction works is not difficult to explain. Let us then assume that β is an acute angle such that tan4β=4, so that 4cot4β=1. Thus equation (1) for x1,x2 can be written as x2+4xcot4β−4=0 so that the roots are x1=2tan2β and x2=−2cot2β. Putting these in equations (2) and (3) we get y1=tan(β+π/4)y2=tan(β−π/4)y3=tanβy4=−cotβ and therefore we have 2cos3α+2cos5α=y3=tanβ2cos3α⋅2cos5α=2cos2α+2cos8α=y2=tan(β−π/4) In the given construction we have ∠OCA=4β,∠OCD=β and ∠OCE=π/4−β. Let us assume OA=1 so that we have 2cos∠AOP3+2cos∠AOP5=2(OG−OH)=2(OD+DG)−2(DH−OD)=4OD (since DH=DG)=OD/(1/4)=OD/OC=tanβ and 2cos∠AOP3⋅2cos∠AOP5=−4OG⋅OH=−4OF2=−4OE⋅OA=−OE/(1/4)=−OE/OC=tan(β−π/4) It follows that ∠AOP3=3α and ∠AOP5=5α.
Note: The construction of regular 17-gon as well as its proof is taken from "An Introduction to the Theory of Numbers" by G. H. Hardy and E. M. Wright. The construction is originally by Richmond and till date is the simplest one available. See MathWorld page for details. Also the wikipedia entry for heptadecagon gives another construction (steps are shown in an animated GIF figure), but it has relatively greater number of steps.
Print/PDF Version
Interesting you didnt mention the term “Heptadecagon”. http://en.wikipedia.org/wiki/Heptadecagon has a step by step animation of how you can actually draw the Heptadecagon.
Here is another interesting link: http://mathworld.wolfram.com/GeometricConstruction.html
SD
March 20, 2013 at 2:01 PMSD, the post has been updated and references to Wikipedia and MathWorld have been provided. Thanks for providing the references.
Paramanand
March 20, 2013 at 2:01 PM