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)?
(In reply to No Subject
Well, I wouldn't be surprised if there's a simple, elegant proof of impossibility, but I sure don't see it.