Optimal packings of 13 and 46 unit squares in a square
Summary: Let \(s(n)\) be the side length of the smallest square into which \(n\) non-overlapping unit squares can be packed. We show that \(s(m^2 - 3) = m\) for \(m = 4, 7\), implying that the most efficient packings of 13 and 46 squares are the trivial ones.
scientific article; zbMATH DE number 5799454