A simple method for perfect packing of squares of sidelengths \(n^{-1/2-\epsilon}\) (Q6169837)

A packing of a rectangle \(R\) by a family (finite or infinite) of squares \(Q_1, Q_2, \dots\) is called \textit{perfect} if the area of \(R\) equals the sum of these squares. Following a historic survey of the existing results on almost perfect packing, the author provides a simple method for perfect packing a square by squares of side lengths \(1, 2^{-t}, 3^{-t}, 4^{-t}, \dots\).