[math-fun] packing squares of two sizes

greetings funsters, packing unit squares in a square has been picked over pretty well. but what if we want to pack n squares of one size and m squares of another size (possibly the same, possibly zero) in a unit square so that no squares overlap, and the total area covered is a maximum? the case where n=m is of special interest. the best i could do can be found here: http://www.stetson.edu/ ~efriedma/mathmagic/0400.html i welcome any improvements, and i'm sure there are some. erich friedman