Question 114
Let $m, n$ be positive integers. Suppose that a given rectangle can be tiled (without overlaps) by a combination of horizontal $1 \times m$ strips and vertical $n \times 1$ strips. Show that it can be tiled using just one of the two types.