21

Part of 1983 IMO Longlists

Problems(1)

Prove that there are infinitely many positive integers n

Source:

Prove that there are infinitely many positive integers

n

for which it is possible for a knight, starting at one of the squares of an

n \times n

chessboard, to go through each of the squares exactly once.

combinatorics unsolvedcombinatorics