Wolfram Demonstrations Project

12,000+ Open Interactive Demonstrations
Powered by Notebook Technology »

Packing Squares with Side 1/n

Initializing live version
Download to Desktop

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

Snapshots

Details

M. M. Paulhus, "An Algorithm for Packing Squares," Journal of Combinatorial Theory, Series A, 82(2), 1998 pp. 147–157.

Embed Code

Take advantage of the Wolfram Notebook Emebedder for the recommended user experience.

Related Demonstrations More by Author
Browse all topics
Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.
Send