Two packing problems
type: Item
instance of: scholarly article
title: Two packing problems
zbMATH Open document ID: 0901.05028
DOI: 10.1016/S0012-365X(97)81831-6
author: J. Ning
published in: Discrete Mathematics
publication date: 1998-01-26T00:00:00Z
review text: 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}\).
Mathematics Subject Classification ID: 05B40
zbMATH DE Number: 1110084
zbMATH Keywords: packing
zbMATH Keywords: rectangle
zbMATH Keywords: square
reviewed by: R. G. Stanton
MaRDI profile type: Publication
cites work: Q4027146
cites work: Unsolved problems in geometry
cites work: On packing unequal rectangles in the unit square
cites work: On packings of squares and rectangles
cites work: On packing of squares and cubes
cites work: Some packing and covering theorems
Recommended article: Q3470374
Recommended article: Q4014128
Recommended article: A two-stage packing problem procedure
Recommended article: A mixed packing problem
Recommended article: Q4871584
Recommended article: On Two Dimensional Packing
Recommended article: On two dimensional packing
Recommended article: Q4270804
Recommended article: On the problem of packing in containers
Recommended article: Two-dimensional packing with conflicts
description: scientific article; zbMATH DE number 1110084