Let n≥3 be an integer. Find the number of ways in which one can place the numbers 1,2,3,…,n2 in the n2 squares of a n×n chesboard, one on each, such that the numbers in each row and in each column are in arithmetic progression. combinatoricscountingChessboardArithmetic Progression