Work

Finding four vertices of a square of area $n$ in a grid by geometric construction

Year: 2026
Type: preprint
Abstract: 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.
Language: English
Open Access status: green
OpenAlex ID: W7236587726
Cites:
Cited by:
Related to: 10