Problem:
Find the smallest positive integer so that a cube with side can be divided into 1996 cubes each with side a positive integer.
Solution
Solution:
Divide all the cubes into unit cubes. Then the 1996 cubes must each contain at least one unit cube, so the large cube contains at least 1996 unit cubes. But , so it is certainly not possible for .
It can be achieved with 13 by (actually packing the cubes together to form a cube is trivial since there are so many unit cubes).
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.