Two packing problems (Q1377835): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q587392 |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Ralph G.Stanton / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4027146 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Unsolved problems in geometry / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On packing unequal rectangles in the unit square / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On packings of squares and rectangles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On packing of squares and cubes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some packing and covering theorems / rank | |||
Normal rank |
Latest revision as of 09:32, 28 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Two packing problems |
scientific article |
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