Packing Squares with Side 1/n
Requires a Wolfram Notebook System
Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.
A finite volume of potatoes will fit in a finite sack. This seemingly simple statement leads to a family of very difficult questions, sometimes called potato sack problems.
Contributed by: Ed Pegg Jr (March 2011)
Open content licensed under CC BY-NC-SA
M. M. Paulhus, "An Algorithm for Packing Squares," Journal of Combinatorial Theory, Series A, 82(2), 1998 pp. 147–157.
"Packing Squares with Side 1/n"
Wolfram Demonstrations Project
Published: March 7 2011