A constructible polygon, in this context, is a regular polygon that can be constructed with a compass and
straightedge. Compass
and straightedgegeometric
constructions dating back to Euclid (Heath 1956) were capable of inscribing regular polygons of 3, 4, 5, 6, 8, 10, 12, 15, 16,
20, 24, 30, 32, 40, 48, 60, 64, ..., sides. Gauss (1801, pp. 662-665) gave a
sufficient condition for a regular
n-gon to be constructible, which he also asserted to be necessary
without supplying a proof, thus showing that regular
n-gons were constructible for , 4, 5, 6, 8, 10, 12, 15, 16,
17, 20, 24, 30, 32, 34, 40, 48, 51, 60, 64, ... (OEIS A003401;
Gauss 1801, pp. 662-665).
A complete enumeration of "constructible" polygons is given by those with central angles corresponding to so-called trigonometry
angles.
Gardner (1977) and independently Watkins (Conway and Guy 1996, Kríek et al. 2001) noticed that the numbers of sides for the known constructible
regular polygons with odd
numbers of sides are given by rows 1 through 31 of the Sierpiński
sieve interpreted as binary numbers, giving 3, 5,
15, 17, 51, 85, 255, ... (OEIS A045544; Conway
and Guy 1996, p. 140). Including row 0 adds the empty
product 1 (OEIS A004729), which is not
a polygon side count. These 32 row values are the products
of subsets of the five known Fermat
primes. An additional Fermat prime, if one exists,
would give further odd constructible side counts.