A simple method for perfect packing of squares of sidelengths \(n^{-1/2-\epsilon}\) (Q6169837)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7711104
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple method for perfect packing of squares of sidelengths \(n^{-1/2-\epsilon}\) |
scientific article; zbMATH DE number 7711104 |
Statements
A simple method for perfect packing of squares of sidelengths \(n^{-1/2-\epsilon}\) (English)
0 references
12 July 2023
0 references
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\).
0 references
square
0 references
perfect packing
0 references
0.9018276929855348
0 references
0.90182763338089
0 references
0.8818833231925964
0 references
0.8675147294998169
0 references
0.8545554280281067
0 references
