Remember
Square Divisions? This problem demonstrates the deconstruction of a square into smaller squares with integerlength 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)?
If it is possible to solve
The volume of small cuThe volume of 60 unite cube is 216 000
The volume of cubes from 130 = 216 225
The max volume of cubes until 31 = 219 016
If any bigger cube is used, the max volume is less than 216 000, therefore either a 31 or a 30 unit cube must be in the final solution.
However I wonder if there is any...

Posted by Detti
on 20041008 12:10:44 