An algorithm for packing squares (Q1268620)

Consider the problem of finding the smallest \(\varepsilon\) such that the reciprocal squares with sides of length \(1/i\) (where \(i\) ranges from \(2\) upward) can be packed in a rectangle of area \(\pi^2/6-1 +\varepsilon\). The author shows that \(\varepsilon< 1/1244918662\); he also shows that the odd reciprocal squares can be packed in a rectangle of area \(\pi^2/8- 1+\varepsilon\), where \(\varepsilon< 1/2231168737\). He proves a similar result for packing rectangles in a square of side \(1+\varepsilon\). All the results are constructive.