IMC 2000, Day 2, Problem 1
a) Show that the unit square can be partitioned into smaller squares if is large enough.
b) Let . Show that there is a constant such that, whenever , a -dimensional unit cube can be partitioned into smaller cubes.
Original from the official PDF

This transcription was compared symbol by symbol with the original, but not yet by a person.
Work for at least 45 minutes before opening the solution.
Official solution
Solution. We start with the following lemma: If and be coprime positive integers then every sufficiently large positive integer can be expressed in the form with non-negative integers.
Proof of the lemma. The numbers , , , , give a complete residue system modulo . Consequently, for any there exists a so that . If , then , for which , is a non-negative integer, too.
Now observe that any dissection of a cube into smaller cubes may be refined to give a dissection into cubes, for any . This refinement is achieved by picking an arbitrary cube in the dissection, and cutting it into smaller cubes. To prove the required result, then, it suffices to exhibit two relatively prime integers of form . In the 2-dimensional case, and give the coprime numbers and . In the general case, two such integers are and , as is easy to check.
Transcribed from the official solutions, page 1. This transcription has not been checked a second time; if in doubt, look at the original.
Archive problem: the statement is the official text (transcribed, with the original above). Subject classification and difficulty were estimated automatically; hints and a worked solution are added over time.
How did it go?
Moves you mark come back sooner in triage.