chessboard problem

Viewing 1 post (of 1 total)
  • Author
    Posts
  • #18493

    Let $n\geq 3$ be an integer. Find the number of ways in which one can place the numbers $1, 2, 3, \ldots, n^2$ in the $n^2$ squares of a $n \times n$ chessboard, one on each, such that the numbers in each row and in each column are in arithmetic progression.

Viewing 1 post (of 1 total)
  • You must be logged in to reply to this topic.