This can be achieved by cyclic permutation of α, β, and γ. Satisfaction of these two conditions ensures that the resulting square is a semi-magic square; and such Greek and Latin squares are said to be mutually orthogonal to each other. For a given order n, there are at most n - 1 squares in a set of mutually orthogonal squares, not counting the variations due to permutation of the symbols. This upper bound is exact when n is a prime number.
This can be achieved by cyclic permutation of α β and γ Satisfaction of these two conditions ensures that the resulting square is a semi-magic square; and such Greek and Latin squares are said to be mutually orthogonal to each other For a given order n there are at most n - 1 squares in a set of mutually orthogonal squares not counting the variations due to permutation of the symbols This upper bound is exact when n is a prime number