Remember Square Divisions? This problem demonstrates the deconstruction of a square into smaller squares with integer-length sides.

Given a cube with edge length 60, can you find a deconstruction of the cube into smaller cubes (none of which are alike) with integer length sides (or prove it can't be done)?

On a related note, there are squares which can be divided into smaller squares with different edge lenghts.  For example a square with edge length of 112 can be divided into 21 smaller squares: 2, 4, 6, 7, 8, 9, 11, 15, 16, 17, 18, 19, 24, 25, 27, 29, 33, 35, 37, 42, 50.

Posted by Brian Smith on 2004-10-03 00:29:12