Packing squares into a rectangle with a relatively small area (Q6098932)
From MaRDI portal
![]() | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Packing squares into a rectangle with a relatively small area |
scientific article; zbMATH DE number 7697390
Language | Label | Description | Also known as |
---|---|---|---|
English | Packing squares into a rectangle with a relatively small area |
scientific article; zbMATH DE number 7697390 |
Statements
Packing squares into a rectangle with a relatively small area (English)
0 references
19 June 2023
0 references
Let \(\alpha>0\) be a real number, \(m\geq\max(17, \frac{4}{e^{\alpha}-1})\), \(\epsilon<\frac{1}{m-\frac{1}{e^{\alpha}-1}}\left( 1+\frac{2}{e^{2\alpha}-1}\right)\). Then all squares with side lengths \(\frac{1}{m+1},\frac{1}{m+2},\ldots\) can be packed into the rectangle with dimensions \(\alpha\times\epsilon\). Similar results are also proved for packing rectangles \(\frac{1}{m+1}\times \frac{1}{m+2}, \frac{1}{m+2}\times \frac{1}{m+3},\ldots\) and squares with side lengths \(\frac{1}{2m+1},\frac{1}{2m+3},\ldots\). The proofs are based on some new inequalities with harmonic numbers.
0 references
packing
0 references
square
0 references
rectangle
0 references
smallest area
0 references
harmonic numbers
0 references