Tightly Packed Squares

What is the smallest rectangle that can hold squares of sizes 1 to ? This problem is unsolved for more than 27 squares. The excess area in these packings is 0,1,1,5,5, 8,14,6,15,20, 7,17,17,20,25, 16,9,30,21,20, 33,27,28,28,22, 29,26. How the excess is bounded for higher is an unsolved problem, but the bounds seem to be and .

(34 lines omitted)

Richard E. Korf, "Optimal Rectangle Packing: New Results," 2004.
Ed Pegg Jr, "Square Packing," 2003.
Mathematica 7 Just Released--Get Mathematica Player 7 Free--Download Now


Share & Bookmark This Demonstration


 
Powered by Wolfram Mathematica
Give us your feedback
Give us your feedback

Source page:




 often  occasionally  never

Note: Please do not include anything you consider confidential or proprietary. Your message and contact information may be shared with the author of any specific Demonstration for which you give feedback, but will not otherwise be published or distributed.
Privacy Policy »

Note: To run this Demonstration you need the free
Mathematica Player
or Mathematica 7+
Download or upgrade to Mathematica Player 7
I already have Mathematica Player or Mathematica 7+