regular polygon exists for all n>2?

gimmytang · science forum beginner Joined: 29 Apr 2005 Posts: 2

Just want to make sure if I have n nodes(n>2), there always exists an alignment in which all edges and angles are equivalent.
gim

Alexander Bogomolny · science forum beginner Joined: 03 May 2005 Posts: 11

For any n > 2, you can divide the angle of 360 degrees into n equal parts.

Draw a circle. Draw at its center the n lines (or rather rays emanating from the center) that form n 360/n angles. These will intersect the circle at the vertices of a regular n-gon.

A. Bogomolny
http://www.cut-the-knot.org

Google