Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

What is the sidelength of the smallest square in which one can fit $n$ non-overlapping squares of sidelengths $1,2,3,4,...,n$ ?

And what is the sidelength of the smallest cube in which one can fit $n$ non-intersecting cubes of sidelengths $1,2,3,4,...,n$ ?

All squares/cubes have all sides paralell, no rotation

share|cite|improve this question
For squares, there is information at The series is I didn't find a series for cubes and my Google search turned up travel tips on packing. – Ross Millikan Nov 2 '11 at 20:01
I'll accept asymptotics – TROLLKILLER Nov 2 '11 at 20:56
The sum of the squares up to $n^2$ is $n(n+1)(2n+1)/6$, so when $n$ gets very large I would expect them to pack into about the square root of that, $\sqrt{n^3/6}$. Similarly for cubes, the volume is $n^2(n+1)^2/4$ and I would expect the cube root of that. This is just because you have lots of little pieces, so shouldn't have to waste that much space, no better than that. – Ross Millikan Nov 2 '11 at 21:18
up vote 1 down vote accepted

For 180 dollars, you can get a 37 squares solution and there is some discussion of cubes and here's a discussion of 70 squares.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.