Optimal packings of unit squares in a square
Let \(s(n)\) denote the minimal possible side length of a square in which \(n\) unit squares can be packed without intersection in interior points. Apart from the trivial equality \(s(k^2)=k\), a few values of \(s(n)\) are known. In the paper under review, the author proves that \(s(7)=3\) (implying that \(s(8)=3\)) and \(s(15)=4\).
scientific article; zbMATH DE number 1604251