Maths Olympiad Prep

Library / /11 of 61

Geometry Difficulty 5.1 AIME, harder Prove it Ibero-American Mathematical Olympiad

Problem:
Find the smallest positive integer nn so that a cube with side nn 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 123=1728<1996<2197=13312^3 = 1728 < 1996 < 2197 = 13^3, so it is certainly not possible for n<13n < 13.

It can be achieved with 13 by 153+1123+198413=1331 \cdot 5^3 + 11 \cdot 2^3 + 1984 \cdot 1^3 = 13^3 (actually packing the cubes together to form a 13×13×1313 \times 13 \times 13 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.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.