Abstract
Let $s(n)$ be the side of the smallest square into which we can pack $n$ unit squares. The purpose of this paper is to prove that $s(n^2-n)
Improved Packings of $n(n − 1)$ Unit Squares in a Square
2021
DOI 10.37236/8586
How this score is calculated
It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.