Finding four vertices of a square of area $n$ in a grid by geometric construction
In this study, we consider geometric construction in an infinite square grid. Our purpose is to find efficient methods for constructing a square of area $n\in\mathbb{N}$ based on arithmetic properties of the sum of squares. As a consequence, for each $n\in\mathbb{N}$, we derive the optimal number of construction steps required to determine the four vertices of the square. Furthermore, we classify all positive integers into three classes according to these optimal numbers.
Authors
- Dohyeok Kim
- Yunsoo Jang
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-11-18
- DOI
- https://doi.org/10.48550/arxiv.2611.24315
- Primary Topic
- Mathematics and Applications
- Type
- preprint