Perfect square packings (Q1841223)

A packing of all squares of side \(n^{-t}\) (\(n \geq 1\) an integer, \(t>1/2\) fixed) is called perfect if it fits into the square of area \(\sum_{n=1}^{\infty} n^{-2t}\). The author considers an algorithm for the construction of perfect packings for \(1/2<t \leq 3/5\). A part of the proof is computer-generated but successfully implemented for all values of \(t\) the author has tried.