In post #2 there is a formula for generating any odd n. You will be able to program it easily. I have also showed you how to modify them for your type of numbers, also easy to program.

For even n, as I said there is a new paper. But it is unrefereed and not even checked. It claims to have algorithm for all even n too. I have not verified their work.

Here is one that I did using M for the algorithm in post #2, it is a 15 x 15.

]]>Is there a way to figure out the magic number without sorting a square?

If there are n rows, the magic number must be

sum{all numbers}/n

The method I use is partly trial and improvement.

(i) Add up all the numbers. Divide by n to get the required total (=T) for any row.

(ii) Pick any set of n numbers that add to T. Make that row one.

(iii) Pick any set from the remainder that add to make T. Make that row two.

(iv) Continue like this until you have all the rows or an impossible set left.

(v) If the latter juggle some numbers about until the rows all work.

(vi) Now shuffle the numbers only within their rows until a column works too.

(vii) Keep that column fixed but shuffle the remainder within their rows until all the columns work.

(viii) Swap whole rows or whole columns until the diagonals work too.

example with 1,2,3,4,5,6,7,8,9

(i) sum = 45 => T = 45/3 = 15

(ii) I chose 9, 1, 5

(iii) Then I chose 7, 2 6 which meant the third row was bound to work as well: (iv)+ (v) 3,4,8 diagram one.

(vi) + (vii) see diagram two

(viii) The last two diagrams show whole row and column swaps.

Bob

]]>Check the rows and columns and diagonals, each will be 74.

]]>But you have shuffled them in post #4

]]>]]>

11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26]]>