MathDB

Consider a

6 \times 6

grid. Define a diagonal to be the six squares whose coordinates

(i,j)

(

1 \le i,j \le 6)

satisfy

i-j \equiv k \pmod 6

for some

k=0,1,\dots,5

. Hence there are six diagonals.
Determine if it is possible to fill it with the numbers

1,2,\dots,36

(each exactly once) such that each row, each column, and each of the six diagonals has the same sum.

Problem Statement