Type:

Other

Description:

What is the smallest rectangle that can hold all the squares of sizes 1 to ... ? This problem is unsolved for more than 32 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,35,31,31, 34,35. How the excess is bounded for higher ... is an unsolved problem, but the bounds seem to be ... and ... .

Subjects:

    Education Levels:

      Keywords:

      EUN,LOM,LRE4,work-cmr-id:398546,http://demonstrations.wolfram.com:http://demonstrations.wolfram.com/TightlyPackedSquares/,ilox,learning resource exchange,LRE metadata application profile,LRE

      Language:

      Access Privileges:

      Public - Available to anyone

      License Deed:

      Creative Commons Attribution 3.0

      Collections:

      None
      This resource has not yet been aligned.
      Curriki Rating
      'NR' - This resource has not been rated
      NR
      'NR' - This resource has not been rated

      This resource has not yet been reviewed.

      Not Rated Yet.

      Non-profit Tax ID # 203478467