Browse · MathNet
PrintXXXI Brazilian Math Olympiad
Brazil geometry
Problem
Prove that there exists a positive integer with the following property: for each integer it is possible to partition a cube into 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 cubes by performing A times and B times. Since and are non-negative integers, one can obtain any number of cubes bigger than , so one can choose .
Techniques
3D ShapesGreatest common divisors (gcd)Techniques: modulo, size analysis, order analysis, inequalities