Question 79
The $n \times n \times n$ cube is constructed from $n^{3}$ unit cubes $1 \times 1 \times 1$ such that at least one of the unit cubes is black. Show that we can always cut the $n \times n \times n$ cube into rectangular boxes such that each box contains exactly one black unit cube.