MathDB

Prove that there are infinitely many positive integers n

Source:

October 5, 2010

combinatorics unsolvedcombinatorics

Problem Statement

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.