- #1
Anita6363
- 2
- 0
Determine all integers n> 1, for which in the square box of dimensions (n x n) you can enter different squares of integers, so that the sum of numbers in each row and in each column of the array is a square of an integer, and all the 2n sums are different.