Two packing problems
From MaRDI portal
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}\).
Recommendations
- Publication:3470374
- scientific article; zbMATH DE number 68157
- A two-stage packing problem procedure
- A mixed packing problem
- scientific article; zbMATH DE number 862374
- On Two Dimensional Packing
- On two dimensional packing
- scientific article; zbMATH DE number 1366757
- On the problem of packing in containers
- Two-dimensional packing with conflicts
Cites work
Cited in
(19)- Rectangles as sums of squares
- An algorithm for packing squares
- Perfect packings of squares using the stack-pack strategy
- On packings of squares and rectangles
- Packing rectangles into a rectangle
- On packing unequal squares
- Perfectly packing a square by squares of sidelength \(f(n)^{-t}\)
- On a Square Packing Problem
- scientific article; zbMATH DE number 125447 (Why is no real title available?)
- scientific article; zbMATH DE number 2042238 (Why is no real title available?)
- A problem on packing a square with sequence of squares
- Packing a triangle by equilateral triangles of harmonic sidelengths
- Packing squares into a rectangle with a relatively small area
- A simple method for perfect packing of squares of sidelengths \(n^{-1/2-\epsilon}\)
- On packing squares into a rectangle
- Perfectly packing a square by squares of nearly harmonic sidelength
- Packing of odd squares revisited
- On packing of rectangles in a rectangle
- Perfect packing of \(d\)-cubes
This page was built for publication: Two packing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1377835)
