Slack-Pack Algorithm for Meir–Moser Packing Problem
Abstract
The well-known problem posed by A. Meir and L. Moser consists of tiling the unit square with rectangles whose side lengths are $$1/n\times 1/(n+1)$$ , where the index $$n$$ ranges from 1 to infinity. Recently, Terence Tao proved that it is possible to tile a square, whose area equals the sum of the areas of these rectangles, using rectangles of size $$1/n^{t}\times 1/(n+1)^{t}$$ (or squares with side length $$1/n^{t}$$ ) for $$1/2
Fields of Study & Subjects
Optimization and Packing Problems
Advanced Manufacturing and Logistics Optimization
VLSI and FPGA Design Techniques
Publication details
- Journal / source
- Lobachevskii Journal of Mathematics
- Publisher
- Pleiades Publishing Ltd
- Volume
- 47
- Issue
- 5
- Pages
- 2346–2363
- Publication date
- 1 May 2026
- Language
- EN