Abstract
‘Square arrays’ is concerned with magic squares and latin squares. An n × n magic square, or a magic square of order n, is a square array of numbers (usually the numbers from 1 to n2) arranged so that the sum of the numbers in each of the n rows, each of the n columns, or each of the two main diagonals is the same. A latin square of order n, is a square array with n symbols arranged so that each symbol appears just once in each row and each column. Orthogonal latin squares are also discussed along with Euler’s 36 officers problem.
