22 Oct
2003
22 Oct
'03
5:34 a.m.
This MPQ talk is similar to a problem I had considered - what is the smallest square needed to house all 1..n squares? e.g. with 1x1, we need a 1x1 square with 1x1 and 2x2, we need a 3x3 square with 1x1, 2x2 and 3x3, we need a 5x5 square. So a lower bound is 2n-1. However with all the squares from say 1 to 8, this packing fails. Jon Perry perry@globalnet.co.uk http://www.users.globalnet.co.uk/~perry/maths/ http://www.users.globalnet.co.uk/~perry/DIVMenu/ BrainBench MVP for HTML and JavaScript http://www.brainbench.com