Zur Gitterpunktüberdeckung durch reguläre n-Ecke mit ungerader Eckenzahl. (On lattice-point-coverings by regular n-gons with an odd number of vertices) (Q582583): Difference between revisions

The author determines the largest square that can be inscribed into a regular polygon with an odd number n of vertices, or, equivalently, the minimum size of a regular n-gon that has the lattice point covering property. For even n he had already solved the problem. The delicacy and tediousness of argument and computation seems to be inherent to the problem.