Given a chess board, we consider all the rectangles whose edges lie along grid lines (the board consists of 81 unit squares, and the grid lines lie on the borders of the unit squares). For each such rectangle, we put a mark in every one of the unit squares inside it. When this process is completed, how many unit squares will contain an even number of marks?
Solution
56. Consider the rectangles which contain the square in the th row and th column. There are possible positions for the upper edge of such a rectangle, for the lower edge, for the left edge, and for the right edge; thus we have rectangles altogether, which is odd iff are both odd, i.e. iff . There are thus 25 unit squares which lie in an odd number of rectangles, so the answer is .
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.