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)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: 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) |
scientific article; zbMATH DE number 4131171
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 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) |
scientific article; zbMATH DE number 4131171 |
Statements
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) (English)
0 references
1987
0 references
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.
0 references
regular polygon
0 references
lattice point covering
0 references
0.7399495840072632
0 references
