Question 161
Call each rectangle $1 \times 2$ (or $2 \times 1$) a simple rectangle. Call each rectangle $2 \times 3$ (or $3 \times 2$) cut out two squares $1 \times 1$ at opposite vertices a deficient rectangle (see figures below).
One tiles a number of simple rectangles and a number deficient rectangles to form a rectangle of size $2008 \times 2010$. For such a tiling, what is the minimal number of simple rectangles needed ?
One tiles a number of simple rectangles and a number deficient rectangles to form a rectangle of size $2008 \times 2010$. For such a tiling, what is the minimal number of simple rectangles needed ?