# INMO - 1992

Find the number of ways in which one can place the numbers $$1,2,3,...,{ n }^{ 2 }$$ on the $${ n }^{ 2 }$$ squares of $$n \times n$$ chess board, one on each, such that the numbers in each row and each column are in arithmetic progression. (Assume n ≥ 3).

×

Problem Loading...

Note Loading...

Set Loading...