Question 41
Let $n \geqslant 3$ be an integer. Each row of an $(n-2) \times n$ table contains the numbers from 1 to $n$, each exactly once; moreover, in each column all the numbers are different. Show that the table can be completed into an $n \times n$ table in such a way that every row and every column contains all the numbers from 1 to $n$.