ILL 1983 Problem 21

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.