Produces magic squares of prime order using the standard method
Usage
magic.prime(n,i=2,j=3)
Arguments
n
The order of the square
i
row number of increment
j
column number of increment
Author
Robin K. S. Hankin
Details
Claimed to work for order any prime \(p\) with \((p,ij)=1\), but
I've tried it (with the defaults for i and j) for many
composite integers of the form \(6n+1\) and \(6n-1\) and
found no exceptions; indeed, they all seem to be panmagic. It is not
clear to me when the process works and when it doesn't.