Let be an odd integer. On an chessboard the center square and four corners are deleted. We wish to group the remaining squares into pairs, such that the two squares in each pair intersect at exactly one point (i.e. they are diagonally adjacent, sharing a single corner). For which odd integers is this possible?
Solution
Constructions for and are easy. For , color the odd rows black and the even rows white. If the squares can be paired in the way desired, each pair we choose must have one black cell and one white cell, so the numbers of black cells and white cells are the same. The number of black cells is or depending on whether the removed center cell is in an odd row. The number of white cells is or . But so for this pairing is impossible. Thus the answer is and .
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.