Perfectly Packing a Square by Squares of Nearly Harmonic Sidelength

Discrete Comput Geom. 2024;71(4):1178-1189. doi: 10.1007/s00454-023-00523-y. Epub 2023 Jul 1.

Abstract

A well-known open problem of Meir and Moser asks if the squares of sidelength 1/n for n2 can be packed perfectly into a rectangle of area n=2n-2=π2/6-1. In this paper we show that for any 1/2<t<1, and any n0 that is sufficiently large depending on t, the squares of sidelength n-t for nn0 can be packed perfectly into a square of area n=n0n-2t. This was previously known (if one packs a rectangle instead of a square) for 1/2<t2/3 (in which case one can take n0=1).

Keywords: Harmonic series; Meir–Moser problem; Square packing.