info prev up next book cdrom email home

Box-Packing Theorem

The number of ``prime'' boxes is always finite, where a set of boxes is prime if it cannot be built up from one or more given configurations of boxes.

See also Conway Puzzle, Cuboid, de Bruijn's Theorem, Klarner's Theorem, Slothouber-Graatsma Puzzle


References

Honsberger, R. Mathematical Gems II. Washington, DC: Math. Assoc. Amer., p. 74, 1976.




© 1996-9 Eric W. Weisstein
1999-05-26