scientific article; zbMATH DE number 1059210

Publication date 12 January 1998

additive square algorithmic methods classical squares magic squares

Orthogonal arrays, Latin squares, Room squares (05B15)

In the general case magic squares represent by themselves numerical or analytical square tables, whose elements satisfy a set of definite basic and additional relations. The basic relations therewith assign some constant property for the elements located in the rows, columns and two main diagonals of a square table, and additional relations, assign additional characteristics for some other sets of its elements. In particular, when the constant property is a significant sum of various elements in rows, columns or main diagonals of the square, then this square is an additive one. When an additive square is composed of successive natural numbers ranging from 1 to \(n\times n\), then it is a classical one. It is evident that from the viewpoint of mathematics an analytical solution of the problem of constructing classical squares of the \(n\)th order consists in determining a form for functions \(f\) and \(g\), which permit to compute the position for any natural number \(N\) from 1 to \(n\times n\) in cells of the squares \((x=f(N,n)\), \(y= g(N,n))\). In this paper we introduce a set of different types for the functions \(f\) and \(g\) and for a few algorithmic methods to construct classical squares. For the entire collection see [Zbl 0868.00042].

Recommendations

Cited in

(4)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4353523)