On Packing Unequal Squares

This paper improves the bound, due to D. Jennings [J. Combin. Theory Ser. A68(1994), 465–469], on the smallest rectangle into which all of the squares of side length 1/n, n=2, 3, 4, ... can be packed. The question of whether a packing with an arbitrarily small excess area is possible remains unanswered.