Question 5
Consider a $2008\times2008$ chessboard. Let $M$ be the smallest number of rectangles that can be drawn on the chessboard so that the sides of every cell of the board are contained in the sides of one of the rectangles. Find $M$. For example, for a $2\times3$ chessboard, $M=3$.