%eq%

%ne%

%gt%

%lt%

%ge%

%le%

Compares two magic squares according to Fr'{e}nicle's method.
 Mnemonic is the old Fortran <dquote>.GT.</dquote> (for <dquote>Greater Than</dquote>)
 comparison et seq.To compare magic square <code>a</code> with magic square <code>b</code>, their
elements are compared in rowwise order: <code>a[1,1]</code> is compared with
<code>b[1,1]</code>, then <code>a[1,2]</code> with <code>b[1,2]</code>, up to
<code>a[n,n]</code>. Consider the first element that is different, say
<code>[i,j]</code>. Then <code>a<b< code=""> if <code>a[i,j]<b[i,j]< code="">.</b[i,j]<></code></b<></code>The generalization to hypercubes is straightforward: comparisons are
carried out natural order.

array

a collection of efficient, vectorized algorithms for the
 creation and investigation of magic squares, including methods for
 creating normal magic squares of any order greater than 2.  The
 ultimate intention is for the package to be a computerized embodiment
 all magic square knowledge, including direct numerical verification
 of properties of magic squares (such as recent results on the
 determinant of odd-ordered semimagic squares).  The package also
 serves as a rebuttal to the often-heard comment "I thought R
 was just for statistics".

Last chance! 50% off unlimited learning

eq: Comparison of two magic squares

Description

Usage

Arguments

See Also

Examples