Two packing problems (Q1377835)
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 1110084
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two packing problems |
scientific article; zbMATH DE number 1110084 |
Statements
Two packing problems (English)
0 references
26 January 1998
0 references
The author shows that the squares of sides \({1\over 3},{1\over 5},{1\over 7},{1\over 9},\dots\) can all be packed into a rectangle of size \({71\over 105}\) by \({15182\over 43407}\). Similarly, all the rectangles of size \({1\over n}\) by \({1\over n+1}\) \((n\geq 1)\) can be packed into the square of size \({501\over 500}\).
0 references
packing
0 references
rectangle
0 references
square
0 references
0 references
0 references
0 references
0.8472367
0 references
0.84610504
0 references
