Maths Olympiad Prep

Library / /595 of 860

Combinatorics Difficulty 5.3 AIME, harder Find the answer

Let n>1n>1 be an odd integer. On an n×nn \times n chessboard the center square and four corners are deleted. We wish to group the remaining n25n^{2}-5 squares into 12(n25)\frac{1}{2}(n^{2}-5) 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 n>1n>1 is this possible?

A number or a short expression. Spacing and $ signs are ignored.

Solution

Constructions for n=3n=3 and n=5n=5 are easy. For n>5n>5, 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 n+12n4\frac{n+1}{2}n-4 or n+12n5\frac{n+1}{2}n-5 depending on whether the removed center cell is in an odd row. The number of white cells is n12n\frac{n-1}{2}n or n12n1\frac{n-1}{2}n-1. But (n+12n5)n12n=n5\left(\frac{n+1}{2}n-5\right)-\frac{n-1}{2}n=n-5 so for n>5n>5 this pairing is impossible. Thus the answer is n=3n=3 and n=5n=5.

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.

Source: Omni-MATH, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.