Maths Olympiad Prep

Library / /1 of 16

Geometry Difficulty 4.5 AIME Prove it Brazil

Prove that there exists a positive integer n0n_0 with the following property: for each integer nn0n \ge n_0 it is possible to partition a cube into nn smaller cubes.

Solution

Consider the following two operations, A and B: A consists in cutting a cube in 8 equal cubes of half its dimensions; B consists in cutting a cube in 27 equal cubes of one third of its dimensions. A and B increases the total number of cubes in 7 and 26, respectively, so one can obtain 1+7x+26y1 + 7x + 26y cubes by performing A xx times and B yy times. Since gcd(7,26)=1\text{gcd}(7, 26) = 1 and x,yx, y are non-negative integers, one can obtain any number of cubes bigger than 1+7267261 + 7 \cdot 26 - 7 - 26, so one can choose n0=1+726726+1n_0 = 1 + 7 \cdot 26 - 7 - 26 + 1.

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 and solution reproduced as published; topic and difficulty added by this site.