Abstract :
This paper improves the previous bound (Jennings, in press), from 133132 to 204203, concerning the smallest square into which all of the rectangles of size 1/n × 1/(n + 1), n = 1, 2, 3, …, can be packed. It also investigates the problem of determining the rectangle of smallest area into which the squares of side 1/n, n = 3, 5, 7, …, can be packed.
