IMC 2000 · Problem 1

a) Show that the unit square can be partitioned into $n$ smaller squares if $n$ is large enough.

b) Let $d \ge 2$. Show that there is a constant $N(d)$ such that, whenever $n \ge N(d)$, a $d$-dimensional unit cube can be partitioned into $n$ smaller cubes.