Regular polygon 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. 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. 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
Regular polygon all "n"-gons with a given perimeter, the one with the largest area is regular. 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, and they knew how to construct a regular polygon with double the number of sides of a given regular polygon. 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