MathDB
2016 Team #4

Source:

December 30, 2016

Problem Statement

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 n2−5n^2-5 squares into 12(n2−5)\frac12(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?
Back to ProblemsView on AoPS