Geometric constructibility of cyclic polygons and a limit theorem

Gábor Czédli, Ádám Kunos

We study convex cyclic polygons, that is, inscribed $n$-gons. Starting from P. Schreiber's idea, published in 1993, we prove that these polygons are not constructible from their si…