Hello, hastings!

Are they any other restrictions to the numbers?

As stated, the problem is rather silly.

Suppose that we have a 3x3 matrix such that the sum of each row

and that of each column is equal to the same non-negative integer S.

If each entry is known to be a non-negative integer

and same number can be used more than once in each row or in each column,

how many such 3x3 matrices are there? . .

Since numbers can be repeated, the problem is trivial.

. . A solution is: . . for any

Using three different integers:

. . a solution is: . . for any

Even if the numbers must beconsecutiveintegers,

. . a solution is: . . for any