New Home › Forums › Math Olympiad - IOQM › Number Theory › chessboard problem
Let be an integer. Find the number of ways in which one can place the numbers in the squares of a chessboard, one on each, such that the numbers in each row and in each column are in arithmetic progression.
.
be an integer. Find the number of ways in which one can place the numbers 
in the 
squares of a 
chessboard, one on each, such that the numbers in each row and in each column are in arithmetic progression.
.