Packing Squares with Side 1/n
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.
M. M. Paulhus, "An Algorithm for Packing Squares," Journal of Combinatorial Theory, Series A, 82(2), 1998 pp. 147–157.