betaFeedback

WorksMathematics

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

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∈Nn\in\mathbb{N} based on arithmetic properties of the sum of squares. As a consequence, for each n∈Nn\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.

Paper details

vlnc:W_fy35zt8n
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…