Problem

Source: Seniors Problem 7

Tags: combinatorics unsolved, combinatorics



Find all positive integers n such that one can write an integer 1 to $ n^2$ into each unit square of a $ n^2 \times n^2$ table in such a way that, in each row, each column and each $ n \times n$ block of unit squares, each number 1 to $ n^2$ occurs exactly once.