Magic square

In recreational mathematics, a square array of numbers, usually positive integers, is called a magic square if the sums of the numbers in each row, each column, and both main diagonals are the same. The 'order' of the magic square is the number of integers along one side (''n''), and the constant sum is called the ' magic constant'. If the array includes just the positive integers $1,2,...,n^2$, the magic square is said to be 'normal'. Some authors take magic square to mean normal magic square.

Magic squares that include repeated entries do not fall under this definition and are referred to as 'trivial'. Some well-known examples, including the Sagrada Família magic square and the Parker square are trivial in this sense. When all the rows and columns but not both diagonals sum to the magic constant this gives a ''semimagic square (sometimes called orthomagic square).

The mathematical study of magic squares typically deals with their construction, classification, and enumeration. Although completely general methods for producing all the magic squares of all orders do not exist, historically three general techniques have been discovered: by bordering method, by making composite magic squares, and by adding two preliminary squares. There are also more specific strategies like the continuous enumeration method that reproduces specific patterns. Magic squares are generally classified according to their order ''n'' as: odd if ''n'' is odd, evenly even (also referred to as "doubly even") if ''n'' is a multiple of 4, oddly even (also known as "singly even") if ''n'' is any other even number. This classification is based on different techniques required to construct odd, evenly even, and oddly even squares. Beside this, depending on further properties, magic squares are also classified as associative magic squares, pandiagonal magic squares, most-perfect magic squares, and so on. More challengingly, attempts have also been made to classify all the magic squares of a given order as transformations of a smaller set of squares. Except for ''n'' ≤ 5, the enumeration of higher order magic squares is still an open challenge. The enumeration of most-perfect magic squares of any order was only accomplished in the late 20th century.

Magic squares have a long history, dating back to at least 190 BCE in China. At various times they have acquired occult or mythical significance, and have appeared as symbols in works of art. In modern times they have been generalized a number of ways, including using extra or different constraints, multiplying instead of adding cells, using alternate shapes or more than two dimensions, and replacing numbers with shapes and addition with geometric operations.

History

The third-order magic square was known to Chinese mathematicians as early as 190 BCE, and explicitly given by the first century of the common era. The first dateable instance of the fourth-order magic square occurred in 587 CE in India. Specimens of magic squares of order 3 to 9 appear in an encyclopedia from Baghdad , the '' Encyclopedia of the Brethren of Purity'' (''Rasa'il Ikhwan al-Safa''). By the end of 12th century, the general methods for constructing magic squares were well established. Around this time, some of these squares were increasingly used in conjunction with magic letters, as in Shams Al-ma'arif, for occult purposes. In India, all the fourth-order pandiagonal magic squares were enumerated by Narayana in 1356. Magic squares were made known to Europe through translation of Arabic sources as occult objects during the Renaissance, and the general theory had to be re-discovered independent of prior developments in China, India, and Middle East. Also notable are the ancient cultures with a tradition of mathematics and numerology that did not discover the magic squares: Greeks, Babylonians, Egyptians, and Pre-Columbian Americans.

China

While ancient references to the pattern of even and odd numbers in the 3×3 magic square appears in the '' I Ching'', the first unequivocal instance of this magic square appears in the chapter called ''Mingtang'' (Bright Hall) of a 1st-century book ''Da Dai Liji'' (Record of Rites by the Elder Dai), which purported to describe ancient Chinese rites of the Zhou dynasty.
These numbers also occur in a possibly earlier mathematical text called ''Shushu jiyi'' (Memoir on Some Traditions of Mathematical Art), said to be written in 190 BCE. This is the earliest appearance of a magic square on record; and it was mainly used for divination and astrology. The 3×3 magic square was referred to as the "Nine Halls" by earlier Chinese mathematicians. The identification of the 3×3 magic square to the legendary Luoshu chart was only made in the 12th century, after which it was referred to as the Luoshu square. The oldest surviving Chinese treatise that displays magic squares of order larger than 3 is Yang Hui's ''Xugu zheqi suanfa'' (Continuation of Ancient Mathematical Methods for Elucidating the Strange) written in 1275. The contents of Yang Hui's treatise were collected from older works, both native and foreign; and he only explains the construction of third and fourth-order magic squares, while merely passing on the finished diagrams of larger squares. He gives a magic square of order 3, two squares for each order of 4 to 8, one of order nine, and one semi-magic square of order 10. He also gives six magic circles of varying complexity.

The above magic squares of orders 3 to 9 are taken from Yang Hui's treatise, in which the Luo Shu principle is clearly evident. The order 5 square is a bordered magic square, with central 3×3 square formed according to Luo Shu principle. The order 9 square is a composite magic square, in which the nine 3×3 sub squares are also magic. After Yang Hui, magic squares frequently occur in Chinese mathematics such as in Ding Yidong's ''Dayan suoyin'' (), Cheng Dawei's '' Suanfa tongzong'' (1593), Fang Zhongtong's ''Shuduyan'' (1661) which contains magic circles, cubes and spheres, Zhang Chao's ''Xinzhai zazu'' (), who published China's first magic square of order ten, and lastly Bao Qishou's ''Binaishanfang ji'' (), who gave various three dimensional magic configurations. However, despite being the first to discover the magic squares and getting a head start by several centuries, the Chinese development of the magic squares are much inferior compared to the Indian, Middle Eastern, or European developments. The high point of Chinese mathematics that deals with the magic squares seems to be contained in the work of Yang Hui; but even as a collection of older methods, this work is much more primitive, lacking general methods for constructing magic squares of any order, compared to a similar collection written around the same time by the Byzantine scholar Manuel Moschopoulos. This is possibly because of the Chinese scholars' enthralment with the Lo Shu principle, which they tried to adapt to solve higher squares; and after Yang Hui and the fall of Yuan dynasty, their systematic purging of the foreign influences in Chinese mathematics.

Japan

Japan and China have similar mathematical traditions and have repeatedly influenced each other in the history of magic squares. The Japanese interest in magic squares began after the dissemination of Chinese works—Yang Hui's ''Suanfa'' and Cheng Dawei's ''Suanfa tongzong''—in the 17th century, and as a result, almost all the '' wasans'' devoted their time to its study.

In the 1660 edition of ''Ketsugi-sho'', Isomura Kittoku gave both odd and even ordered bordered magic squares as well as magic circles; while the 1684 edition of the same book contained a large section on magic squares, demonstrating that he had a general method for constructing bordered magic squares. In ''Jinko-ki'' (1665) by Muramatsu Kudayu Mosei, both magic squares and magic circles are displayed. The largest square Mosei constructs is of 19th order. Various magic squares and magic circles were also published by Nozawa Teicho in ''Dokai-sho'' (1666), Sato Seiko in ''Kongenki'' (1666), and Hosino Sanenobu in ''Ko-ko-gen Sho'' (1673). One of Seki Takakazu's ''Seven Books'' (''Hojin Yensan'') (1683) is devoted completely to magic squares and circles. This is the first Japanese book to give a general treatment of magic squares in which the algorithms for constructing odd, singly even and doubly even bordered magic squares are clearly described. In 1694 and 1695, Yueki Ando gave different methods to create the magic squares and displayed squares of order 3 to 30. A fourth-order magic cube was constructed by Yoshizane Tanaka (1651–1719) in ''Rakusho-kikan'' (1683). The study of magic squares was continued by Seki's pupils, notably by Katahiro Takebe, whose squares were displayed in the fourth volume of ''Ichigen Kappo'' by Shukei Irie, Yoshisuke Matsunaga in ''Hojin-Shin-jutsu'', Yoshihiro Kurushima in ''Kyushi Iko'' who rediscovered a method to produce the odd squares given by Agrippa, and Naonobu Ajima. Thus by the beginning of the 18th century, the Japanese mathematicians were in possession of methods to construct magic squares of arbitrary order. After this, attempts at enumerating the magic squares was initiated by Nushizumi Yamaji.

India

The 3×3 magic square first appears in India in ''Gargasamhita'' by Garga, who recommends its use to pacify the nine planets (''navagraha''). The oldest version of this text dates from 100 CE, but the passage on planets could not have been written earlier than 400 CE. The first dateable instance of 3×3 magic square in India occur in a medical text ''Siddhayog'' (c. 900 CE) by Vrnda, which was prescribed to women in labor in order to have easy delivery.

The oldest dateable fourth order magic square in the world is found in an encyclopaedic work written by Varahamihira around 587 CE called ''Brhat Samhita''. The magic square is constructed for the purpose of making perfumes using 4 substances selected from 16 different substances. Each cell of the square represents a particular ingredient, while the number in the cell represents the proportion of the associated ingredient, such that the mixture of any four combination of ingredients along the columns, rows, diagonals, and so on, gives the total volume of the mixture to be 18. Although the book is mostly about divination, the magic square is given as a matter of combinatorial design, and no magical properties are attributed to it. The special features of this magic square were commented on by Bhattotpala (c. 966 CE)

The square of Varahamihira as given above has sum of 18. Here the numbers 1 to 8 appear twice in the square. It is a pan-diagonal magic square. Four different magic squares can be obtained by adding 8 to one of the two sets of 1 to 8 sequence. The sequence is selected such that the number 8 is added exactly twice in each row, each column and each of the main diagonals. One of the possible magic squares shown in the right side. This magic square is remarkable in that it is a 90 degree rotation of a magic square that appears in the 13th century Islamic world as one of the most popular magic squares.

The construction of 4th-order magic square is detailed in a work titled ''Kaksaputa'', composed by the alchemist Nagarjuna around 10th century CE. All of the squares given by Nagarjuna are 4×4 magic squares, and one of them is called ''Nagarjuniya'' after him. Nagarjuna gave a method of constructing 4×4 magic square using a primary skeleton square, given an odd or even magic sum. The Nagarjuniya square is given below, and has the sum total of 100.

The Nagarjuniya square is a pan-diagonal magic square. The Nagarjuniya square is made up of two arithmetic progressions starting from 6 and 16 with eight terms each, with a common difference between successive terms as 4. When these two progressions are reduced to the normal progression of 1 to 8, the adjacent square is obtained.

Around 12th-century, a 4×4 magic square was inscribed on the wall of Parshvanath temple in Khajuraho, India. Several Jain hymns teach how to make magic squares, although they are undateable.

As far as is known, the first systematic study of magic squares in India was conducted by Thakkar Pheru, a Jain scholar, in his ''Ganitasara Kaumudi'' (c. 1315). This work contains a small section on magic squares which consists of nine verses. Here he gives a square of order four, and alludes to its rearrangement; classifies magic squares into three (odd, evenly even, and oddly even) according to its order; gives a square of order six; and prescribes one method each for constructing even and odd squares. For the even squares, Pheru divides the square into component squares of order four, and puts the numbers into cells according to the pattern of a standard square of order four. For odd squares, Pheru gives the method using horse move or knight's move. Although algorithmically different, it gives the same square as the De la Loubere's method.

The next comprehensive work on magic squares was taken up by Narayana Pandit, who in the fourteenth chapter of his ''Ganita Kaumudi'' (1356) gives general methods for their construction, along with the principles governing such constructions. It consists of 55 verses for rules and 17 verses for examples. Narayana gives a method to construct all the pan-magic squares of fourth order using knight's move; enumerates the number of pan-diagonal magic squares of order four, 384, including every variation made by rotation and reflection; three general methods for squares having any order and constant sum when a standard square of the same order is known; two methods each for constructing evenly even, oddly even, and of squares when the sum is given. While Narayana describes one older method for each species of square, he claims the method of superposition for evenly even and odd squares and a method of interchange for oddly even squares to be his own invention. The superposition method was later re-discovered by De la Hire in Europe. In the last section, he conceives of other figures, such as circles, rectangles, and hexagons, in which the numbers may be arranged to possess properties similar to those of magic squares. Below are some of the magic squares constructed by Narayana:

The order 8 square is interesting in itself since it is an instance of the most-perfect magic square. Incidentally, Narayana states that the purpose of studying magic squares is to construct ''yantra'', to destroy the ego of bad mathematicians, and for the pleasure of good mathematicians. The subject of magic squares is referred to as ''bhadraganita'' and Narayana states that it was first taught to men by god Shiva.

Middle East, North Africa, Muslim Iberia

Although the early history of magic squares in Persia and Arabia is not known, it has been suggested that they were known in pre-Islamic times. It is clear, however, that the study of magic squares was common in medieval Islam, and it was thought to have begun after the introduction of chess into the region. The first dateable appearance of a magic square of order 3 occurs in Jābir ibn Hayyān's (fl. c. 721 – c. 815) ''Kitab al-mawazin al-Saghir'' (The Small Book of Balances) where the magic square and its related numerology is associated with alchemy. While it is known that treatises on magic squares were written in the 9th century, the earliest extant treaties date from the 10th-century: one by Abu'l-Wafa al-Buzjani () and another by Ali b. Ahmad al-Antaki (). These early treatises were purely mathematical, and the Arabic designation for magic squares used is ''wafq al-a'dad'', which translates as ''harmonious disposition of the numbers''. By the end of 10th century, the two treatises by Buzjani and Antaki makes it clear that the Middle Eastern mathematicians had understood how to construct bordered squares of any order as well as simple magic squares of small orders (''n'' ≤ 6) which were used to make composite magic squares. A specimen of magic squares of orders 3 to 9 devised by Middle Eastern mathematicians appear in an encyclopedia from Baghdad , the Rasa'il Ikhwan al-Safa (the Encyclopedia of the Brethren of Purity). The squares of order 3 to 7 from Rasa'il are given below:

The 11th century saw the finding of several ways to construct simple magic squares for odd and evenly-even orders; the more difficult case of evenly-odd case (''n = 4k + 2'') was solved by Ibn al-Haytham with ''k'' even (c. 1040), and completely by the beginning of 12th century, if not already in the latter half of the 11th century. Around the same time, pandiagonal squares were being constructed. Treaties on magic squares were numerous in the 11th and 12th century. These later developments tended to be improvements on or simplifications of existing methods. From the 13th century on wards, magic squares were increasingly put to occult purposes. However, much of these later texts written for occult purposes merely depict certain magic squares and mention their attributes, without describing their principle of construction, with only some authors keeping the general theory alive. One such occultist was the Algerian Ahmad al-Buni (c. 1225), who gave general methods on constructing bordered magic squares; some others were the 17th century Egyptian Shabramallisi and the 18th century Nigerian al-Kishnawi.

The magic square of order three was described as a child-bearing charm since its first literary appearances in the alchemical works of Jābir ibn Hayyān (fl. c. 721 – c. 815) and al-Ghazālī (1058–1111) and it was preserved in the tradition of the planetary tables. The earliest occurrence of the association of seven magic squares to the virtues of the seven heavenly bodies appear in Andalusian scholar Ibn Zarkali's (known as Azarquiel in Europe) (1029–1087) ''Kitāb tadbīrāt al-kawākib'' (''Book on the Influences of the Planets''). A century later, the Algerian scholar Ahmad al-Buni attributed mystical properties to magic squares in his highly influential book ''Shams al-Ma'arif'' (''The Book of the Sun of Gnosis and the Subtleties of Elevated Things''), which also describes their construction. This tradition about a series of magic squares from order three to nine, which are associated with the seven planets, survives in Greek, Arabic, and Latin versions. There are also references to the use of magic squares in astrological calculations, a practice that seems to have originated with the Arabs.

Latin Europe

Unlike in Persia and Arabia, better documentation exists of how the magic squares were transmitted to Europe. Around 1315, influenced by Arab sources, the Greek Byzantine scholar Manuel Moschopoulos wrote a mathematical treatise on the subject of magic squares, leaving out the mysticism of his Middle Eastern predecessors, where he gave two methods for odd squares and two methods for evenly even squares. Moschopoulos was essentially unknown to the Latin Europe until the late 17th century, when Philippe de la Hire rediscovered his treatise in the Royal Library of Paris. However, he was not the first European to have written on magic squares; and the magic squares were disseminated to rest of Europe through Spain and Italy as occult objects. The early occult treaties that displayed the squares did not describe how they were constructed. Thus the entire theory had to be rediscovered.

Magic squares had first appeared in Europe in ''Kitāb tadbīrāt al-kawākib'' (''Book on the Influences of the Planets'') written by Ibn Zarkali of Toledo, Al-Andalus, as planetary squares by 11th century. The magic square of three was discussed in numerological manner in early 12th century by Jewish scholar Abraham ibn Ezra of Toledo, which influenced later Kabbalists. Ibn Zarkali's work was translated as ''Libro de Astromagia'' in the 1280s, due to Alfonso X of Castille. In the Alfonsine text, magic squares of different orders are assigned to the respective planets, as in the Islamic literature; unfortunately, of all the squares discussed, the Mars magic square of order five is the only square exhibited in the manuscript.

Magic squares surface again in Florence, Italy in the 14th century. A 6×6 and a 9×9 square are exhibited in a manuscript of the ''Trattato d'Abbaco'' (Treatise of the Abacus) by Paolo Dagomari. It is interesting to observe that Paolo Dagomari, like Pacioli after him, refers to the squares as a useful basis for inventing mathematical questions and games, and does not mention any magical use. Incidentally, though, he also refers to them as being respectively the Sun's and the Moon's squares, and mentions that they enter astrological calculations that are not better specified. As said, the same point of view seems to motivate the fellow Florentine Luca Pacioli, who describes 3×3 to 9×9 squares in his work ''De Viribus Quantitatis'' by the end of 15th century.

Europe after 15th century

The planetary squares had disseminated into northern Europe by the end of 15th century. For instance, the Cracow manuscript of '' Picatrix'' from Poland displays magic squares of orders 3 to 9. The same set of squares as in the Cracow manuscript later appears in the writings of Paracelsus in ''Archidoxa Magica'' (1567), although in highly garbled form. In 1514 Albrecht Dürer immortalized a 4×4 square in his famous engraving '' Melencolia I.'' Paracelsus' contemporary Heinrich Cornelius Agrippa von Nettesheim published his famous three volume book ''De occulta philosophia'' in 1531, where he devoted Chapter 22 of Book II to the planetary squares shown below. The same set of squares given by Agrippa reappear in 1539 in ''Practica Arithmetice'' by Girolamo Cardano, where he explains the construction of the odd ordered squares using "diamond method", which was later reproduced by Bachet. The tradition of planetary squares was continued into the 17th century by Athanasius Kircher in ''Oedipi Aegyptici'' (1653). In Germany, mathematical treaties concerning magic squares were written in 1544 by Michael Stifel in'' Arithmetica Integra'', who rediscovered the bordered squares, and Adam Riese, who rediscovered the continuous numbering method to construct odd ordered squares published by Agrippa. However, due to the religious upheavals of that time, these work were unknown to the rest of Europe.

In 1624 France, Claude Gaspard Bachet described the "diamond method" for constructing Agrippa's odd ordered squares in his book ''Problèmes Plaisants''. During 1640 Bernard Frenicle de Bessy and Pierre Fermat exchanged letters on magic squares and cubes, and in one of the letters Fermat boasts of being able to construct 1,004,144,995,344 magic squares of order 8 by his method. An early account on the construction of bordered squares was given by Antoine Arnauld in his ''Nouveaux éléments de géométrie'' (1667). In the two treatise ''Des quarrez ou tables magiques'' and ''Table générale des quarrez magiques de quatre de côté'', published posthumously in 1693, twenty years after his death, Bernard Frenicle de Bessy demonstrated that there were exactly 880 distinct magic squares of order four. Frenicle gave methods to construct magic square of any odd and even order, where the even ordered squares were constructed using borders. He also showed that interchanging rows and columns of a magic square produced new magic squares. In 1691, Simon de la Loubère described the Indian continuous method of constructing odd ordered magic squares in his book ''Du Royaume de Siam'', which he had learned while returning from a diplomatic mission to Siam, which was faster than Bachet's method. In an attempt to explain its working, de la Loubere used the primary numbers and root numbers, and rediscovered the method of adding two preliminary squares. This method was further investigated by Abbe Poignard in ''Traité des quarrés sublimes'' (1704), by Philippe de La Hire in ''Mémoires de l'Académie des Sciences'' for the Royal Academy (1705), and by Joseph Sauveur in ''Construction des quarrés magiques'' (1710). Concentric bordered squares were also studied by De la Hire in 1705, while Sauveur introduced magic cubes and lettered squares, which was taken up later by Euler in 1776, who is often credited for devising them. In 1750 d'Ons-le-Bray rediscovered the method of constructing doubly even and singly even squares using bordering technique; while in 1767 Benjamin Franklin published a semi-magic square that had the properties of eponymous Franklin square. By this time the earlier mysticism attached to the magic squares had completely vanished, and the subject was treated as a part of recreational mathematics.

In the 19th century, Bernard Violle gave a comprehensive treatment of magic squares in his three volume ''Traité complet des carrés magiques'' (1837–1838), which also described magic cubes, parallelograms, parallelopipeds, and circles. Pandiagonal squares were extensively studied by Andrew Hollingworth Frost, who learned it while in the town of Nasik, India, (thus calling them Nasik squares) in a series of articles: ''On the knight's path'' (1877), ''On the General Properties of Nasik Squares'' (1878), ''On the General Properties of Nasik Cubes'' (1878), ''On the construction of Nasik Squares of any order'' (1896). He showed that it is impossible to have normal singly-even pandiagonal magic squares. Frederick A.P. Barnard constructed inlaid magic squares and other three dimensional magic figures like magic spheres and magic cylinders in ''Theory of magic squares and of magic cubes'' (1888). In 1897, Emroy McClintock published ''On the most perfect form of magic squares'', coining the words ''pandiagonal square'' and ''most perfect square'', which had previously been referred to as perfect, or diabolic, or Nasik.

Some famous magic squares

Luo Shu magic square

Legends dating from as early as 650 BCE tell the story of the Lo Shu (洛書) or "scroll of the river Lo". According to the legend, there was at one time in ancient China a huge flood. While the great king Yu was trying to channel the water out to sea, a turtle emerged from it with a curious pattern on its shell: a 3×3 grid in which circular dots of numbers were arranged, such that the sum of the numbers in each row, column and diagonal was the same: 15. According to the legend, thereafter people were able to use this pattern in a certain way to control the river and protect themselves from floods. The Lo Shu Square, as the magic square on the turtle shell is called, is the unique normal magic square of order three in which 1 is at the bottom and 2 is in the upper right corner. Every normal magic square of order three is obtained from the Lo Shu by rotation or reflection.

Magic square in Parshavnath temple

There is a well-known 12th-century 4×4 normal magic square inscribed on the wall of the Parshvanath temple in Khajuraho, India.

This is known as the ''Chautisa Yantra'' (''Chautisa'', 34; '' Yantra'', lit. "device"), since its magic sum is 34. It is one of the three 4×4 pandiagonal magic squares and is also an instance of the most-perfect magic square. The study of this square led to the appreciation of pandiagonal squares by European mathematicians in the late 19th century. Pandiagonal squares were referred to as Nasik squares or Jain squares in older English literature.

Albrecht Dürer's magic square

The order four normal magic square Albrecht Dürer immortalized in his 1514 engraving '' Melencolia I'', referred to above, is believed to be the first seen in European art. The square associated with Jupiter appears as a talisman used to drive away melancholy. It is very similar to Yang Hui's square, which was created in China about 250 years before Dürer's time. As with every order 4 normal magic square, the magic sum is 34. But in the Durer square this sum is also found
in each of the quadrants, in the center four squares, and in the corner squares (of the 4×4 as well as the four contained 3×3 grids). This sum can also be found in the four outer numbers clockwise from the corners (3+8+14+9) and likewise the four counter-clockwise (the locations of four queens in the two solutions of the 4 queens puzzle), the two sets of four symmetrical numbers (2+8+9+15 and 3+5+12+14), the sum of the middle two entries of the two outer columns and rows (5+9+8+12 and 3+2+15+14), and in four kite or cross shaped quartets (3+5+11+15, 2+10+8+14, 3+9+7+15, and 2+6+12+14). The two numbers in the middle of the bottom row give the date of the engraving: 1514. The numbers 1 and 4 at either side of the date correspond respectively to the letters "A" and "D," which are the initials of the artist.

Dürer's magic square can also be extended to a magic cube.

Sagrada Família magic square

The Passion façade of the Sagrada Família church in Barcelona, conceptualized by Antoni Gaudí and designed by sculptor Josep Subirachs, features a trivial order 4 magic square: The magic constant of the square is 33, the age of Jesus at the time of the Passion. Structurally, it is very similar to the Melancholia magic square, but it has had the numbers in four of the cells reduced by 1.

Trivial squares such as this one are not generally mathematically interesting and only have historical significance. Lee Sallows has pointed out that, due to Subirachs's ignorance of magic square theory, the renowned sculptor made a needless blunder, and supports this assertion by giving several examples of non-trivial 4×4 magic squares showing the desired magic constant of 33.

Similarly to Dürer's magic square, the Sagrada Familia's magic square can also be extended to a magic cube.

Parker square

The Parker Square, named after recreational mathematician Matt Parker, is an attempt to create a 33 magic square of squares — a prized unsolved problem since Euler. The Parker Square is a trivial semimagic square since it uses some numbers more than once, and the diagonal sums to , not as for all the other rows, columns, or diagonal. The Parker Square became a "mascot for people who give it a go, but ultimately fall short". It is also a metaphor for something that is almost right, but is a little off.

Gardner square

The Gardner Square, named after recreational mathematician Martin Gardner, similar to the Parker square,
is given as a problem to determine a, b, c and d;

This solution for a=74, b=113, c=94 and d=97 gives a semimagic square; the diagonal sums to , not as for all the other rows, columns and diagonal;

Properties of magic squares

Magic constant

The constant that is the sum of any row, or column, or diagonal is called the magic constant or magic sum, ''M.'' Every normal magic square has a constant dependent on the order , calculated by the formula $M = n(n^2 + 1)/2$. This can be demonstrated by noting that the sum of $1,2,...,n^2$ is $n^2(n^2 + 1)/2$. Since the sum of each row is $M$, the sum of $n$ rows is $n M = n^2(n^2 + 1)/2$, which when divided by the order yields the magic constant. For normal magic squares of orders ''n'' = 3, 4, 5, 6, 7, and 8, the magic constants are, respectively: 15, 34, 65, 111, 175, and 260 (sequence A006003 in the OEIS).

Magic square of order 1 is trivial

The 1×1 magic square, with only one cell containing the number 1, is called '' trivial'', because it is typically not under consideration when discussing magic squares; but it is indeed a magic square by definition, if a single cell is regarded as a square of order one.

Magic square of order 2 cannot be constructed

Normal magic squares of all sizes can be constructed except 2×2 (that is, where order ''n'' = 2).

Center of mass

If the numbers in the magic square are seen as masses located in various cells, then the center of mass of a magic square coincides with its geometric center.

Moment of inertia

The ''moment of inertia'' of a magic square has been defined as the sum over all cells of the number in the cell times the squared distance from the center of the cell to the center of the square; here the unit of measurement is the width of one cell. (Thus for example a corner cell of a 3×3 square has a distance of $\sqrt,$ a non-corner edge cell has a distance of 1, and the center cell has a distance of 0.) Then all magic squares of a given order have the same moment of inertia as each other. For the order-3 case the moment of inertia is always 60, while for the order-4 case the moment of inertia is always 340. In general, for the ''n''×''n'' case the moment of inertia is $n^2(n^4-1)/12.$

Birkhoff–von Neumann decomposition

Dividing each number of the magic square by the magic constant will yield a doubly stochastic matrix, whose row sums and column sums equal to unity. However, unlike the doubly stochastic matrix, the diagonal sums of such matrices will also equal to unity. Thus, such matrices constitute a subset of doubly stochastic matrix. The Birkhoff–von Neumann theorem states that for any doubly stochastic matrix $A$, there exists real numbers $\theta_1,\ldots,\theta_k \ge 0$, where $\sum_^k \theta_i = 1$ and permutation matrices $P_1,\ldots,P_k$ such that

:$A = \theta_1 P_1 + \cdots + \theta_k P_k.$

This representation may not be unique in general. By Marcus-Ree theorem, however, there need not be more than $k \le n^2 - 2n + 2$ terms in any decomposition. Clearly, this decomposition carries over to magic squares as well, since a magic square can be recovered from a doubly stochastic matrix by multiplying it by the magic constant.

Classification of magic squares

While the classification of magic squares can be done in many ways, some useful categories are given below. An ''n''×''n'' square array of integers 1, 2, ..., ''n''² is called:
* ''Semi-magic square'' when its rows and columns sum to give the magic constant.
* ''Simple magic square'' when its rows, columns, and two diagonals sum to give magic constant and no more. They are also known as ''ordinary magic squares'' or ''normal magic squares''.
* ''Self-complementary magic square'' when it is a magic square which when complemented (i.e. each number subtracted from ''n''² + 1) will give a rotated or reflected version of the original magic square.
* ''Associative magic square'' when it is a magic square with a further property that every number added to the number equidistant, in a straight line, from the center gives ''n''² + 1. They are also called ''symmetric magic squares''. Associative magic squares do not exist for squares of singly even order. All associative magic square are self-complementary magic squares as well.
* '' Pandiagonal magic square'' when it is a magic square with a further property that the broken diagonals sum to the magic constant. They are also called ''panmagic squares'', ''perfect squares'', ''diabolic squares'', ''Jain squares'', or ''Nasik squares''. Panmagic squares do not exist for singly even orders. However, singly even non-normal squares can be panmagic.
* ''Ultra magic square'' when it is both associative and pandiagonal magic square. Ultra magic square exist only for orders ''n'' ≥ 5.
* ''Bordered magic square'' when it is a magic square and it remains magic when the rows and columns on the outer edge are removed. They are also called ''concentric bordered magic squares'' if removing a border of a square successively gives another smaller bordered magic square. Bordered magic square do not exist for order 4.
* ''Composite magic square'' when it is a magic square that is created by "multiplying" (in some sense) smaller magic squares, such that the order of the composite magic square is a multiple of the order of the smaller squares. Such squares can usually be partitioned into smaller non-overlapping magic sub-squares.
* ''Inlaid magic square'' when it is a magic square inside which a magic sub-square is embedded, regardless of construction technique. The embedded magic sub-squares are themselves referred to as ''inlays''.
* '' Most-perfect magic square'' when it is a pandiagonal magic square with two further properties (i) each 2×2 subsquare add to 1/''k'' of the magic constant where ''n'' = 4''k'', and (ii) all pairs of integers distant ''n''/2 along any diagonal (major or broken) are complementary (i.e. they sum to ''n''² + 1). The first property is referred to as ''compactness'', while the second property is referred to as ''completeness''. Most-perfect magic squares exist only for squares of doubly even order. All the pandiagonal squares of order 4 are also most perfect.
* ''Franklin magic square'' when it is a doubly even magic square with three further properties (i) every bent diagonal adds to the magic constant, (ii) every half row and half column starting at an outside edge adds to half the magic constant, and (iii) the square is ''compact''.
* '' Multimagic square'' when it is a magic square that remains magic even if all its numbers are replaced by their ''k''-th power for 1 ≤ ''k'' ≤ ''P''. They are also known as ''P-multimagic square'' or ''satanic squares''. They are also referred to as ''bimagic squares'', ''trimagic squares'', ''tetramagic squares'', ''pentamagic squares'' when the value of ''P'' is 2, 3, 4, and 5 respectively.

Enumeration of magic squares

;Low order squares
There is only one (trivial) magic square of order 1 and no magic square of order 2. As mentioned above, the set of normal squares of order three constitutes a single equivalence class-all equivalent to the Lo Shu square. Thus there is basically just one normal magic square of order 3.

The number of different ''n'' × ''n'' magic squares for ''n'' from 1 to 5, not counting rotations and reflections is:
: 1, 0, 1, 880, 275305224.
The number for ''n'' = 6 has been estimated to be "Number of Magic Squares From Parallel Tempering Monte Carlo
arxiv.org, April 9, 1998. Retrieved November 2, 2013.

; Magic tori
Cross-referenced to the above sequence, a new classification enumerates the magic tori that display these magic squares. The number of magic tori of order ''n'' from 1 to 5, is:
: 1, 0, 1, 255, 251449712 .

; Higher order squares and tori

The number of distinct normal magic squares rapidly increases for higher orders.

The 880 magic squares of order 4 are displayed on 255 magic tori of order 4 and the 275,305,224 squares of order 5 are displayed on 251,449,712 magic tori of order 5. The number of magic tori and distinct normal squares is not yet known for any higher order.Anything but square: from magic squares to Sudoku
by Hardeep Aiden, Plus Magazine, March 1, 2006

Algorithms tend to only generate magic squares of a certain type or classification, making counting all possible magic squares quite difficult. Since traditional counting methods have proven unsuccessful, statistical analysis using the Monte Carlo method has been applied. The basic principle applied to magic squares is to randomly generate ''n'' × ''n'' matrices of elements 1 to ''n''² and check if the result is a magic square. The probability that a randomly generated matrix of numbers is a magic square is then used to approximate the number of magic squares.

More intricate versions of the Monte Carlo method, such as the exchange Monte Carlo, and Monte Carlo backtracking have produced even more accurate estimations. Using these methods it has been shown that the probability of magic squares decreases rapidly as n increases. Using fitting functions give the curves seen to the right.

Transformations that preserve the magic property

For any magic square

* The sum of any two magic squares of the same order by matrix addition is a magic square.
* A magic square remains magic when all of its numbers undergo the same linear transformation (i.e., a function of the form ). For example, a magic square remains magic when its numbers are multiplied by any constant. Moreover, a magic square remains magic when a constant is added or subtracted to its numbers, or if its numbers are subtracted from a constant. In particular, if every element in a normal magic square of order $n$ is subtracted from $n^2+1$, the complement of the original square is obtained. In the example below, each element of the magic square on the left is subtracted from 17 to obtain the complement magic square on the right.

* A magic square remains magic when transformed by any element of , the symmetry group of a square (see ). Every combination of one or more rotations of 90 degrees, reflections, or both produce eight trivially distinct squares which are generally considered equivalent. The eight such squares are said to make up a single equivalence class. The eight equivalent magic squares for the 3×3 magic square are shown below:

* A magic square of order $n$ remains magic when both its rows and columns are symmetrically permuted by $p$ such that $p(i) + p(n+1-i) = n + 1$ for $1 \le i \le n$. Every permutation of the rows or columns preserves all row and column sums, but generally not the two diagonal sums. If the same permutation $p$ is applied to both the rows and columns, then diagonal element in row $i$ and column $i$ is mapped to row $p(i)$ and column $p(i)$ which is on the same diagonal; therefore, applying the same permutation to rows and columns preserves the main (upper left to lower right) diagonal sum. If the permutation is symmetric as described, then the diagonal element in row $i$ and column $n+1-i$ is mapped to row $p(i)$ and column $p(n+1-i) = n+1-p(i)$ which is on the same diagonal; therefore, applying the same symmetric permutation to both rows and columns preserves both diagonal sums. For even $n$, there are $2^\left(\frac\right)!$ such symmetric permutations, and $2^\left(\frac\right)!$ for $n$ odd. In the example below, the original magic square on the left has its rows and columns symmetrically permuted by $(4, 6, 5, 2, 1, 3)$ resulting in the magic square on the right.

* A magic square of order $n$ remains magic when rows $i$ and $(n+1-i)$ are exchanged and columns $i$ and $(n+1-i)$ are exchanged because this is a symmetric permutation of the form described above. In the example below, the square on the right is obtained by interchanging the 1st and 4th rows and columns of the original square on the left.

* A magic square of order $n$ remains magic when rows $i$ and $j$ are exchanged, rows $(n+1-i)$ and $(n+1-j)$ are exchanged, columns $i$ and $j$ are exchanged, and columns $(n+1-i)$ and $(n+1-j)$ are exchanged where i because this is another symmetric permutation of the form described above. In the example below, the left square is the original square, while the right square is the new square obtained by this transformation. In the middle square, rows 1 and 2 and rows 3 and 4 have been swapped. The final square on the right is obtained by interchanging columns 1 and 2 and columns 3 and 4 of the middle square. In this particular example, this transform rotates the quadrants 180 degrees. The middle square is also magic because the original square is associative.

* A magic square remains magic when its quadrants are diagonally interchanged because this is another symmetric permutation of the form described above. For even-order $n$, permute the rows and columns by permutation $p$ where $p(i) = i+\frac$ for $i\le\frac$, and $p(i) = i-\frac$ for $i>\frac$. For odd-order $n$, permute rows and columns by permutation $p$ where $p(i) = i+\frac$ for $i<\frac$, and $p(i) = i-\frac$ for $i>\frac$. For odd ordered square, the halves of the central row and column are also interchanged. Examples for order 4 and 5 magic squares are given below:

For associative magic squares

* An associative magic square remains associative when two rows or columns equidistant from the center are interchanged. For an even square, there are ''n''/2 pairs of rows or columns that can be interchanged; thus 2^''n''/2 × 2^''n''/2 = 2^''n'' equivalent magic squares by combining such interchanges can be obtained. For odd square, there are (''n'' - 1)/2 pairs of rows or columns that can be interchanged; and 2^''n''-1 equivalent magic squares obtained by combining such interchanges. Interchanging all the rows flips the square vertically (i.e. reflected along the horizontal axis), while interchanging all the columns flips the square horizontally (i.e. reflected along the vertical axis). In the example below, a 4×4 associative magic square on the left is transformed into a square on the right by interchanging the second and third row, yielding the famous Durer's magic square.

* An associative magic square remains associative when two same sided rows (or columns) are interchanged along with corresponding other sided rows (or columns). For an even square, since there are ''n''/2 same sided rows (or columns), there are ''n''(''n'' - 2)/8 pairs of such rows (or columns) that can be interchanged. Thus, 2^{''n''(''n''-2)/8} × 2^{''n''(''n''-2)/8} = 2^{''n''(''n''-2)/4} equivalent magic squares can be obtained by combining such interchanges. For odd square, since there are (''n'' - 1)/2 same sided rows or columns, there are (''n'' - 1)(''n'' - 3)/8 pairs of such rows or columns that can be interchanged. Thus, there are 2^{(''n'' - 1)(''n'' - 3)/8} × 2^{(''n'' - 1)(''n'' - 3)/8} = 2^{(''n'' - 1)(''n'' - 3)/4} equivalent magic squares obtained by combining such interchanges. Interchanging all the same sided rows flips each quadrants of the square vertically, while interchanging all the same sided columns flips each quadrant of the square horizontally. In the example below, the original square is on the left, whose rows 1 and 2 are interchanged with each other, along with rows 3 and 4, to obtain the transformed square on the right.

* An associative magic square remains associative when its entries are replaced with corresponding numbers from a set of ''s'' arithmetic progressions with the same common difference among ''r'' terms, such that ''r × s'' = ''n''², and whose initial terms are also in arithmetic progression, to obtain a non-normal magic square. Here either ''s'' or ''r'' should be a multiple of ''n''. Let us have ''s'' arithmetic progressions given by
::$\begin a & a + c & a + 2c & \cdots & a + (r-1)c \\ a + d & a + c + d & a + 2c + d & \cdots & a + (r-1)c + d \\ a + 2d & a + c + 2d & a + 2c + 2d & \cdots & a + (r-1)c + 2d \\ \cdots & \cdots & \cdots & \cdots & \cdots \\ a + (s-1)d & a + c + (s-1)d & a + 2c + (s-1)d & \cdots & a + (r-1)c + (s-1)d \\ \end$
:where ''a'' is the initial term, ''c'' is the common difference of the arithmetic progressions, and ''d'' is the common difference among the initial terms of each progression. The new magic constant will be
:: M = na + \frac \big (r-1)c+ (s-1)d \big
:If ''s'' = ''r'' = ''n'', then follows the simplification
::$M = na + \frac(n-1)(c+d).$
:With ''a'' = ''c'' = 1 and ''d'' = ''n'', the usual ''M'' = ''n''(''n''²+1)/2 is obtained. For given ''M'' the required ''a'', ''c'', and ''d'' can be found by solving the linear Diophantine equation. In the examples below, there are order 4 normal magic squares on the left most side. The second square is a corresponding non-normal magic square with ''r'' = 8, ''s'' = 2, ''a'' = 1, ''c'' = 1, and ''d'' = 10 such that the new magic constant is ''M'' = 38. The third square is an order 5 normal magic square, which is a 90 degree clockwise rotated version of the square generated by De la Loubere method. On the right most side is a corresponding non-normal magic square with ''a'' = 4, ''c'' = 1, and ''d'' = 6 such that the new magic constant is ''M'' = 90.

For pan-diagonal magic squares

* A pan-diagonal magic square remains a pan-diagonal magic square under cyclic shifting of rows or of columns or both. This allows us to position a given number in any one of the ''n''² cells of an ''n'' order square. Thus, for a given pan-magic square, there are ''n''² equivalent pan-magic squares. In the example below, the original square on the left is transformed by shifting the first row to the bottom to obtain a new pan-magic square in the middle. Next, the 1st and 2nd column of the middle pan-magic square is circularly shifted to the right to obtain a new pan-magic square on the right.

For bordered magic squares

* A bordered magic square remains a bordered magic square after permuting the border cells in the rows or columns, together with their corresponding complementary terms, keeping the corner cells fixed. Since the cells in each row and column of every concentric border can be permuted independently, when the order ''n ≥ 5'' is odd, there are ((n-2)! × (n-4)! × ··· × 3!)² equivalent bordered squares. When ''n ≥ 6'' is even, there are ((n-2)! × (n-4)! × ··· × 4!)² equivalent bordered squares. In the example below, a square of order 5 is given whose border row has been permuted and (3!)² = 36 such equivalent squares can be obtained.

* A bordered magic square remains a bordered magic square after each of its concentric borders are independently rotated or reflected with respect to the central core magic square. If there are ''b'' borders, then this transform will yield 8^''b'' equivalent squares. In the example below of the 5×5 magic square, the border has been rotated 90 degrees anti-clockwise.

For composite magic squares

* A composite magic square remains a composite magic square when the embedded magic squares undergo transformations that do not disturb the magic property (e.g. rotation, reflection, shifting of rows and columns, and so on).

Special methods of construction

Over the millennium, many ways to construct magic squares have been discovered. These methods can be classified as general methods and special methods, in the sense that general methods allow us to construct more than a single magic square of a given order, whereas special methods allow us to construct just one magic square of a given order. Special methods are specific algorithms whereas general methods may require some trial-and-error.

Special methods are standard and most simple ways to construct a magic square. It follows certain configurations / formulas / algorithm which generates regular patterns of numbers in a square. The correctness of these special methods can be proved using one of the general methods given in later sections. After a magic square has been constructed using a special method, the transformations described in the previous section can be applied to yield further magic squares. Special methods are usually referred to using the name of the author(s) (if known) who described the method, for e.g. De la Loubere's method, Starchey's method, Bachet's method, etc.

Magic squares exist for all values of ''n'', except for order 2. Magic squares can be classified according to their order as odd, doubly even (''n'' divisible by four), and singly even (''n'' even, but not divisible by four). This classification is based on the fact that entirely different techniques need to be employed to construct these different species of squares. Odd and doubly even magic squares are easy to generate; the construction of singly even magic squares is more difficult but several methods exist, including the LUX method for magic squares (due to John Horton Conway) and the Strachey method for magic squares.

A method for constructing a magic square of order 3

In the 19th century, Édouard Lucas devised the general formula for order 3 magic squares. Consider the following table made up of positive integers ''a'', ''b'' and ''c'':

These nine numbers will be distinct positive integers forming a magic square with the magic constant 3''c'' so long as 0 < ''a'' < ''b'' < ''c'' − ''a'' and ''b'' ≠ 2''a''. Moreover, every 3×3 magic square of distinct positive integers is of this form.

In 1997 Lee Sallows discovered that leaving aside rotations and reflections, then every distinct parallelogram drawn on the Argand diagram defines a unique 3×3 magic square, and vice versa, a result that had never previously been noted.

A method for constructing a magic square of odd order

A method for constructing magic squares of odd order was published by the French diplomat de la Loubère in his book, ''A new historical relation of the kingdom of Siam'' (Du Royaume de Siam, 1693), in the chapter entitled ''The problem of the magical square according to the Indians''. The method operates as follows:

The method prescribes starting in the central column of the first row with the number 1. After that, the fundamental movement for filling the squares is diagonally up and right, one step at a time. If a square is filled with a multiple of the order ''n'', one moves vertically down one square instead, then continues as before. When an "up and to the right" move would leave the square, it is wrapped around to the last row or first column, respectively.

Starting from other squares rather than the central column of the first row is possible, but then only the row and column sums will be identical and result in a magic sum, whereas the diagonal sums will differ. The result will thus be a semimagic square and not a true magic square. Moving in directions other than north east can also result in magic squares.

A method of constructing a magic square of doubly even order

Doubly even means that ''n'' is an even multiple of an even integer; or 4''p'' (e.g. 4, 8, 12), where ''p'' is an integer.

Generic pattern
All the numbers are written in order from left to right across each row in turn, starting from the top left hand corner. Numbers are then either retained in the same place or interchanged with their diametrically opposite numbers in a certain regular pattern. In the magic square of order four, the numbers in the four central squares and one square at each corner are retained in the same place and the others are interchanged with their diametrically opposite numbers.

A construction of a magic square of order 4
Starting from top left, go left to right through each row of the square, counting each cell from 1 to 16 and filling the cells along the diagonals with its corresponding number. Once the bottom right cell is reached, continue by going right to left, starting from the bottom right of the table through each row, and fill in the non-diagonal cells counting up from 1 to 16 with its corresponding number. As shown below:

An extension of the above example for Orders 8 and 12
First generate a pattern table, where a '1' indicates selecting from the square where the numbers are written in order 1 to n² (left-to-right, top-to-bottom), and a '0' indicates selecting from the square where the numbers are written in reverse order ''n''² to 1. For ''M'' = 4, the pattern table is as shown below (third matrix from left). Whith the unaltered cells (cells with '1') shaded, a criss-cross pattern is obtained.

The patterns are a) there are equal number of '1's and '0's in each row and column; b) each row and each column are "palindromic"; c) the left- and right-halves are mirror images; and d) the top- and bottom-halves are mirror images (c and d imply b). The pattern table can be denoted using hexadecimals as (9, 6, 6, 9) for simplicity (1-nibble per row, 4 rows). The simplest method of generating the required pattern for higher ordered doubly even squares is to copy the generic pattern for the fourth-order square in each four-by-four sub-squares.

For M = 8, possible choices for the pattern are (99, 66, 66, 99, 99, 66, 66, 99); (3C, 3C, C3, C3, C3, C3, 3C, 3C); (A5, 5A, A5, 5A, 5A, A5, 5A, A5) (2-nibbles per row, 8 rows).

For M = 12, the pattern table (E07, E07, E07, 1F8, 1F8, 1F8, 1F8, 1F8, 1F8, E07, E07, E07) yields a magic square (3-nibbles per row, 12 rows.) It is possible to count the number of choices one has based on the pattern table, taking rotational symmetries into account.

Method of superposition

The earliest discovery of the superposition method was made by the Indian mathematician Narayana in the 14th century. The same method was later re-discovered and studied in early 18th century Europe by de la Loubere, Poignard, de La Hire, and Sauveur; and the method is usually referred to as de la Hire's method. Although Euler's work on magic square was unoriginal, he famously conjectured the impossibility of constructing the evenly odd ordered mutually orthogonal Graeco-Latin squares. This conjecture was disproved in the mid 20th century. For clarity of exposition, two important variations of this method can be tinguished.

Euler's method

This method consists in constructing two preliminary squares, which when added together gives the magic square. As a running example, a 3×3 magic square is considered. Each number of the 3×3 natural square by a pair of numbers can be labeled as

where every pair of Greek and Latin alphabets, e.g. ''αa'', are meant to be added together, i.e. ''αa'' = ''α'' + ''a''. Here, (''α'', ''β'', ''γ'') = (0, 3, 6) and (''a'', ''b'', ''c'') = (1, 2, 3). The numbers 0, 3, and 6 are referred to as the ''root numbers'' while the numbers 1, 2, and 3 are referred to as the ''primary numbers''. An important general constraint here is

* ''a Greek letter is paired with a Latin letter only once''.

Thus, the original square can now be split into two simpler squares:

The lettered squares are referred to as ''Greek square'' or ''Latin square'' if they are filled with Greek or Latin letters, respectively. A magic square can be constructed by ensuring that the Greek and Latin squares are magic squares too. The converse of this statement is also often, but not always (e.g. bordered magic squares), true: A magic square can be decomposed into a Greek and a Latin square, which are themselves magic squares. Thus the method is useful for both synthesis as well as analysis of a magic square. Lastly, by examining the pattern in which the numbers are laid out in the finished square, it is often possible to come up with a faster algorithm to construct higher order squares that replicate the given pattern, without the necessity of creating the preliminary Greek and Latin squares.

During the construction of the 3×3 magic square, the Greek and Latin squares with just three unique terms are much easier to deal with than the original square with nine different terms. The row sum and the column sum of the Greek square will be the same, ''α'' + ''β'' + ''γ'', if

* ''each letter appears exactly once in a given column or a row''.

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.

In order to construct a magic square, we should also ensure that the diagonals sum to magic constant. For this, we have a third condition:

* ''either all the letters should appear exactly once in both the diagonals; or in case of odd ordered squares, one of the diagonals should consist entirely of the middle term, while the other diagonal should have all the letters exactly once''.

The mutually orthogonal Greek and Latin squares that satisfy the first part of the third condition (that all letters appear in both the diagonals) are said to be ''mutually orthogonal doubly diagonal Graeco-Latin squares''.

Odd squares: For the 3×3 odd square, since ''α'', ''β'', and ''γ'' are in arithmetic progression, their sum is equal to the product of the square's order and the middle term, i.e. ''α'' + ''β'' + ''γ'' = 3 ''β''. Thus, the diagonal sums will be equal if we have ''β''s in the main diagonal and ''α'', ''β'', ''γ'' in the skew diagonal. Similarly, for the Latin square. The resulting Greek and Latin squares and their combination will be as below. The Latin square is just a 90 degree anti-clockwise rotation of the Greek square (or equivalently, flipping about the vertical axis) with the corresponding letters interchanged. Substituting the values of the Greek and Latin letters will give the 3×3 magic square.

For the odd squares, this method explains why the Siamese method (method of De la Loubere) and its variants work. This basic method can be used to construct odd ordered magic squares of higher orders. To summarise:

* ''For odd ordered squares, to construct Greek square, place the middle term along the main diagonal, and place the rest of the terms along the skew diagonal. The remaining empty cells are filled by diagonal moves. The Latin square can be constructed by rotating or flipping the Greek square, and replacing the corresponding alphabets. The magic square is obtained by adding the Greek and Latin squares.''

A peculiarity of the construction method given above for the odd magic squares is that the middle number (''n''² + 1)/2 will always appear at the center cell of the magic square. Since there are (''n'' - 1)! ways to arrange the skew diagonal terms, we can obtain (''n'' - 1)! Greek squares this way; same with the Latin squares. Also, since each Greek square can be paired with (''n'' - 1)! Latin squares, and since for each of Greek square the middle term may be arbitrarily placed in the main diagonal or the skew diagonal (and correspondingly along the skew diagonal or the main diagonal for the Latin squares), we can construct a total of 2 × (''n'' - 1)! × (''n'' - 1)! magic squares using this method. For ''n'' = 3, 5, and 7, this will give 8, 1152, and 1,036,800 different magic squares, respectively. Dividing by 8 to neglect equivalent squares due to rotation and reflections, we obtain 1, 144, and 129,600 essentially different magic squares, respectively.

As another example, the construction of 5×5 magic square is given. Numbers are directly written in place of alphabets. The numbered squares are referred to as ''primary square'' or ''root square'' if they are filled with primary numbers or root numbers, respectively. The numbers are placed about the skew diagonal in the root square such that the middle column of the resulting root square has 0, 5, 10, 15, 20 (from bottom to top). The primary square is obtained by rotating the root square counter-clockwise by 90 degrees, and replacing the numbers. The resulting square is an associative magic square, in which every pair of numbers symmetrically opposite to the center sum up to the same value, 26. For e.g., 16+10, 3+23, 6+20, etc. In the finished square, 1 is placed at center cell of bottom row, and successive numbers are placed via elongated knight's move (two cells right, two cells down), or equivalently, bishop's move (two cells diagonally down right). When a collision occurs, the break move is to move one cell up. All the odd numbers occur inside the central diamond formed by 1, 5, 25 and 21, while the even numbers are placed at the corners. The occurrence of the even numbers can be deduced by copying the square to the adjacent sides. The even numbers from four adjacent squares will form a cross.

A variation of the above example, where the skew diagonal sequence is taken in different order, is given below. The resulting magic square is the flipped version of the famous Agrippa's Mars magic square. It is an associative magic square and is the same as that produced by Moschopoulos's method. Here the resulting square starts with 1 placed in the cell which is to the right of the centre cell, and proceeds as De la Loubere's method, with downwards-right move. When a collision occurs, the break move is to shift two cells to the right.

In the previous examples, for the Greek square, the second row can be obtained from the first row by circularly shifting it to the right by one cell. Similarly, the third row is a circularly shifted version of the second row by one cell to the right; and so on. Likewise, the rows of the Latin square is circularly shifted to the left by one cell. The row shifts for the Greek and Latin squares are in mutually opposite direction. It is possible to circularly shift the rows by more than one cell to create the Greek and Latin square.

* ''For odd ordered squares, whose order is not divisible by three, we can create the Greek squares by shifting a row by two places to the left or to the right to form the next row. The Latin square is made by flipping the Greek square along the main diagonal and interchanging the corresponding letters. This gives us a Latin square whose rows are created by shifting the row in the direction opposite to that of the Greek square. A Greek square and a Latin square should be paired such that their row shifts are in mutually opposite direction. The magic square is obtained by adding the Greek and Latin squares. When the order also happens to be a prime number, this method always creates pandiagonal magic square.''

This essentially re-creates the knight's move. All the letters will appear in both the diagonals, ensuring correct diagonal sum. Since there are ''n''! permutations of the Greek letters by which we can create the first row of the Greek square, there are thus ''n''! Greek squares that can be created by shifting the first row in one direction. Likewise, there are ''n''! such Latin squares created by shifting the first row in the opposite direction. Since a Greek square can be combined with any Latin square with opposite row shifts, there are ''n''! × ''n''! such combinations. Lastly, since the Greek square can be created by shifting the rows either to the left or to the right, there are a total of 2 × ''n''! × ''n''! magic squares that can be formed by this method. For ''n'' = 5 and 7, since they are prime numbers, this method creates 28,800 and 50,803,200 pandiagonal magic squares. Dividing by 8 to neglect equivalent squares due to rotation and reflections, we obtain 3,600 and 6,350,400 equivalent squares. Further dividing by ''n''² to neglect equivalent panmagic squares due to cyclic shifting of rows or columns, we obtain 144 and 129,600 essentially different panmagic squares. For order 5 squares, these are the only panmagic square there are. The condition that the square's order not be divisible by 3 means that we cannot construct squares of orders 9, 15, 21, 27, and so on, by this method.

In the example below, the square has been constructed such that 1 is at the center cell. In the finished square, the numbers can be continuously enumerated by the knight's move (two cells up, one cell right). When collision occurs, the break move is to move one cell up, one cell left. The resulting square is a pandiagonal magic square. This square also has a further diabolical property that any five cells in quincunx pattern formed by any odd sub-square, including wrap around, sum to the magic constant, 65. For e.g., 13+7+1+20+24, 23+1+9+15+17, 13+21+10+19+2 etc. Also the four corners of any 5×5 square and the central cell, as well as the middle cells of each side together with the central cell, including wrap around, give the magic sum: 13+10+19+22+1 and 20+24+12+8+1. Lastly the four rhomboids that form elongated crosses also give the magic sum: 23+1+9+24+8, 15+1+17+20+12, 14+1+18+13+19, 7+1+25+22+10.

We can also combine the Greek and Latin squares constructed by different methods. In the example below, the primary square is made using knight's move. We have re-created the magic square obtained by De la Loubere's method. As before, we can form 8 × (''n'' - 1)! × ''n''! magic squares by this combination. For ''n'' = 5 and 7, this will create 23,040 and 29,030,400 magic squares. After dividing by 8 in order to neglect equivalent squares due to rotation and reflection, we get 2,880 and 3,628,800 squares.

For order 5 squares, these three methods give a complete census of the number of magic squares that can be constructed by the method of superposition. Neglecting the rotation and reflections, the total number of magic squares of order 5 produced by the superposition method is 144 + 3,600 + 2,880 = 6,624.

Even squares: We can also construct even ordered squares in this fashion. Since there is no middle term among the Greek and Latin alphabets for even ordered squares, in addition to the first two constraint, for the diagonal sums to yield the magic constant, all the letters in the alphabet should appear in the main diagonal and in the skew diagonal.

An example of a 4×4 square is given below. For the given diagonal and skew diagonal in the Greek square, the rest of the cells can be filled using the condition that each letter appear only once in a row and a column.

Using these two Graeco-Latin squares, we can construct 2 × 4! × 4! = 1,152 magic squares. Dividing by 8 to eliminate equivalent squares due to rotation and reflections, we get 144 essentially different magic squares of order 4. These are the only magic squares constructible by the Euler method, since there are only two mutually orthogonal doubly diagonal Graeco-Latin squares of order 4.

Similarly, an 8×8 magic square can be constructed as below. Here the order of appearance of the numbers is not important; however the quadrants imitate the layout pattern of the 4×4 Graeco-Latin squares.

Euler's method has given rise to the study of Graeco-Latin squares. Euler's method for constructing magic squares is valid for any order except 2 and 6.

Variations: Magic squares constructed from mutually orthogonal doubly diagonal Graeco-Latin squares are interesting in themselves since the magic property emerges from the relative position of the alphabets in the square, and not due to any arithmetic property of the value assigned to them. This means that we can assign any value to the alphabets of such squares and still obtain a magic square. This is the basis for constructing squares that display some information (e.g. birthdays, years, etc.) in the square and for creating "reversible squares". For example, we can display the number ''π'' ≈ at the bottom row of a 4×4 magic square using the Graeco-Latin square given above by assigning (''α'', ''β'', ''γ'', ''δ'') = (10, 0, 90, 15) and (''a'', ''b'', ''c'', ''d'') = (0, 2, 3, 4). We will obtain the following non-normal magic square with the magic sum 124:

Narayana-De la Hire's method for even orders

Narayana-De la Hire's method for odd square is the same as that of Euler's. However, for even squares, we drop the second requirement that each Greek and Latin letter appear only once in a given row or column. This allows us to take advantage of the fact that the sum of an arithmetic progression with an even number of terms is equal to the sum of two opposite symmetric terms multiplied by half the total number of terms. Thus, when constructing the Greek or Latin squares,

* ''for even ordered squares, a letter can appear ''n''/2 times in a column but only once in a row, or vice versa.''

As a running example, if we take a 4×4 square, where the Greek and Latin terms have the values (''α'', ''β'', ''γ'', ''δ'') = (0, 4, 8, 12) and (''a'', ''b'', ''c'', ''d'') = (1, 2, 3, 4), respectively, then we have ''α'' + ''β'' + ''γ'' + ''δ'' = 2 (''α'' + ''δ'') = 2 (''β'' + ''γ''). Similarly, ''a'' + ''b'' + ''c'' + ''d'' = 2 (''a'' + ''d'') = 2 (''b'' + ''c''). This means that the complementary pair ''α'' and ''δ'' (or ''β'' and ''γ'') can appear twice in a column (or a row) and still give the desired magic sum. Thus, we can construct:

* ''For even ordered squares, the Greek magic square is made by first placing the Greek alphabets along the main diagonal in some order. The skew diagonal is then filled in the same order or by picking the terms that are complementary to the terms in the main diagonal. Finally, the remaining cells are filled column wise. Given a column, we use the complementary terms in the diagonal cells intersected by that column, making sure that they appear only once in a given row but ''n''/2 times in the given column. The Latin square is obtained by flipping or rotating the Greek square and interchanging the corresponding alphabets. The final magic square is obtained by adding the Greek and Latin squares.''

In the example given below, the main diagonal (from top left to bottom right) is filled with sequence ordered as ''α'', ''β'', ''γ'', ''δ'', while the skew diagonal (from bottom left to top right) filled in the same order. The remaining cells are then filled column wise such that the complementary letters appears only once within a row, but twice within a column. In the first column, since ''α'' appears on the 1st and 4th row, the remaining cells are filled with its complementary term ''δ''. Similarly, the empty cells in the 2nd column are filled with ''γ''; in 3rd column ''β''; and 4th column ''α''. Each Greek letter appears only once along the rows, but twice along the columns. As such, the row sums are ''α'' + ''β'' + ''γ'' + ''δ'' while the column sums are either 2 (''α'' + ''δ'') or 2 (''β'' + ''γ''). Likewise for the Latin square, which is obtained by flipping the Greek square along the main diagonal and interchanging the corresponding letters.

The above example explains why the "criss-cross" method for doubly even magic square works. Another possible 4×4 magic square, which is also pan-diagonal as well as most-perfect, is constructed below using the same rule. However, the diagonal sequence is chosen such that all four letters ''α'', ''β'', ''γ'', ''δ'' appear inside the central 2×2 sub-square. Remaining cells are filled column wise such that each letter appears only once within a row. In the 1st column, the empty cells need to be filled with one of the letters selected from the complementary pair ''α'' and ''δ''. Given the 1st column, the entry in the 2nd row can only be ''δ'' since ''α'' is already there in the 2nd row; while, in the 3rd row the entry can only be ''α'' since ''δ'' is already present in the 3rd row. We proceed similarly until all cells are filled. The Latin square given below has been obtained by flipping the Greek square along the main diagonal and replacing the Greek alphabets with corresponding Latin alphabets.

We can use this approach to construct singly even magic squares as well. However, we have to be more careful in this case since the criteria of pairing the Greek and Latin alphabets uniquely is not automatically satisfied. Violation of this condition leads to some missing numbers in the final square, while duplicating others. Thus, here is an important proviso:

* ''For singly even squares, in the Greek square, check the cells of the columns which is vertically paired to its complement. In such a case, the corresponding cell of the Latin square must contain the same letter as its horizontally paired cell.''

Below is a construction of a 6×6 magic square, where the numbers are directly given, rather than the alphabets. The second square is constructed by flipping the first square along the main diagonal. Here in the first column of the root square the 3rd cell is paired with its complement in the 4th cells. Thus, in the primary square, the numbers in the 1st and 6th cell of the 3rd row are same. Likewise, with other columns and rows. In this example the flipped version of the root square satisfies this proviso.

As another example of a 6×6 magic square constructed this way is given below. Here the diagonal entries are arranged differently. The primary square is constructed by flipping the root square about the main diagonal. In the second square the proviso for singly even square is not satisfied, leading to a non-normal magic square (third square) where the numbers 3, 13, 24, and 34 are duplicated while missing the numbers 4, 18, 19, and 33.

The last condition is a bit arbitrary and may not always need to be invoked, as in this example, where in the root square each cell is vertically paired with its complement:

As one more example, we have generated an 8×8 magic square. Unlike the criss-cross pattern of the earlier section for evenly even square, here we have a checkered pattern for the altered and unaltered cells. Also, in each quadrant the odd and even numbers appear in alternating columns.

Variations: A number of variations of the basic idea are possible: ''a complementary pair can appear ''n''/2 times or less in a column''. That is, a column of a Greek square can be constructed using more than one complementary pair. This method allows us to imbue the magic square with far richer properties. The idea can also be extended to the diagonals too. An example of an 8×8 magic square is given below. In the finished square each of four quadrants are pan-magic squares as well, each quadrant with same magic constant 130.

Method of borders

Bordering method for order 3

In this method, the objective is to wrap a border around a smaller magic square which serves as a core. Consider the 3×3 square for example. Subtracting the middle number 5 from each number 1, 2, ..., 9, we obtain 0, ± 1, ± 2, ± 3, and ± 4, which we will, for lack of better words, following S. Harry White, refer to as bone numbers. The magic constant of a magic square, which we will refer to as the skeleton square, made by these bone numbers will be zero since adding all the rows of a magic square will give ''nM'' = Σ ''k'' = 0; thus ''M'' = 0.

It is not difficult to argue that the middle number should be placed at the center cell: let ''x'' be the number placed in the middle cell, then the sum of the middle column, middle row, and the two diagonals give Σ ''k'' + 3 ''x'' = 4 ''M''. Since Σ ''k'' = 3 ''M'', we have ''x'' = ''M'' / 3. Here ''M'' = 0, so ''x'' = 0.

Putting the middle number 0 in the center cell, we want to construct a border such that the resulting square is magic. Let the border be given by:

Since the sum of each row, column, and diagonals must be a constant (which is zero), we have

: ''a'' + ''a*'' = 0,
: ''b'' + ''b*'' = 0,
: ''u'' + ''u*'' = 0,
: ''v'' + ''v*'' = 0.

Now, if we have chosen ''a'', ''b'', ''u'', and ''v'', then we have ''a*'' = - ''a'', ''b*'' = - ''b'', ''u*'' = - ''u'', and ''v*'' = - ''v''. This means that if we assign a given number to a variable, say ''a'' = 1, then its complement will be assigned to ''a*'', i.e. ''a*'' = - 1. Thus out of eight unknown variables, it is sufficient to specify the value of only four variables. We will consider ''a'', ''b'', ''u'', and ''v'' as independent variables, while ''a*'', ''b*'', ''u*'', and ''v*'' as dependent variables. This allows us to consider a bone number ± x as a single number regardless of sign because (1) its assignment to a given variable, say ''a'', will automatically imply that the same number of opposite sign will be shared with its complement ''a*'', and (2) two independent variables, say ''a'' and ''b'', cannot be assigned the same bone number. But how should we choose ''a'', ''b'', ''u'', and ''v''? We have the sum of the top row and the sum of the right column as

: ''u'' + ''a'' + ''v'' = 0,
: ''v'' + ''b'' + ''u*'' = 0.

Since 0 is an even number, there are only two ways that the sum of three integers will yield an even number: 1) if all three were even, or 2) if two were odd and one was even. Since in our choice of numbers we only have two even non-zero number (± 2 and ± 4), the first statement is false. Hence, it must be the case that the second statement is true: that two of the numbers are odd and one even.

The only way that both the above two equations can satisfy this parity condition simultaneously, and still be consistent with the set of numbers we have, is when ''u'' and ''v'' are odd. For on the contrary, if we had assumed ''u'' and ''a'' to be odd and ''v'' to be even in the first equation, then ''u*'' = - ''u'' will be odd in the second equation, making ''b'' odd as well, in order to satisfy the parity condition. But this requires three odd numbers (''u'', ''a'', and ''b''), contradicting the fact that we only have two odd numbers (± 1 and ± 3) which we can use. This proves that the odd bone numbers occupy the corners cells. When converted to normal numbers by adding 5, this implies that the corners of a 3×3 magic square are all occupied by even numbers.

Thus, taking ''u'' = 1 and ''v'' = 3, we have ''a'' = - 4 and ''b'' = - 2. Hence, the finished skeleton square will be as in the left. Adding 5 to each number, we get the finished magic square.

Similar argument can be used to construct larger squares. Since there does not exist a 2×2 magic square around which we can wrap a border to construct a 4×4 magic square, the next smallest order for which we can construct bordered square is the order 5.

Bordering method for order 5

Consider the fifth-order square. For this, we have a 3×3 magic core, around which we will wrap a magic border. The bone numbers to be used will be ± 5, ± 6, ± 7, ± 8, ± 9, ± 10, ± 11, and ± 12. Disregarding the signs, we have 8 bone numbers, 4 of which are even and 4 of which are odd. In general, for a square of any order ''n'', there will be 4(''n'' - 1) border cells, which are to be filled using 2(''n'' - 1) bone numbers. Let the magic border be given as

As before, we should

* ''place a bone number and its complement opposite to each other, so that the magic sum will be zero.''

It is sufficient to determine the numbers ''u, v, a, b, c, d, e, f'' to describe the magic border. As before, we have the two constraint equations for the top row and right column:

: ''u'' + ''a'' + ''b'' + ''c'' + ''v'' = 0
: ''v'' + ''d'' + ''e'' + ''f'' + ''u*'' = 0.

Multiple solutions are possible. The standard procedure is to

* ''first try to determine the corner cells, after which we will try to determine the rest of the border.''

There are 28 ways of choosing two numbers from the set of 8 bone numbers for the corner cells ''u'' and ''v''. However, not all pairs are admissible. Among the 28 pairs, 16 pairs are made of an even and an odd number, 6 pairs have both as even numbers, while 6 pairs have them both as odd numbers.

We can prove that the corner cells ''u'' and ''v'' cannot have an even and an odd number. This is because if this were so, then the sums ''u'' + ''v'' and ''v'' + ''u*'' will be odd, and since 0 is an even number, the sums ''a'' + ''b'' + ''c'' and ''d'' + ''e'' + ''f'' should be odd as well. The only way that the sum of three integers will result in an odd number is when 1) two of them are even and one is odd, or 2) when all three are odd. Since the corner cells are assumed to be odd and even, neither of these two statements are compatible with the fact that we only have 3 even and 3 odd bone numbers at our disposal. This proves that ''u'' and ''v'' cannot have different parity. This eliminates 16 possibilities.

Using similar type reasoning we can also draw some conclusions about the sets and . If ''u'' and ''v'' are both even, then both the sets should have two odd numbers and one even number. If ''u'' and ''v'' are both odd, then one of the sets should have three even numbers while the other set should have one even number and two odd numbers.

As a running example, consider the case when both ''u'' and ''v'' are even. The 6 possible pairs are: (6, 8), (6, 10), (6, 12), (8, 10), (8, 12), and (10, 12). Since the sums ''u'' + ''v'' and ''v'' + ''u*'' are even, the sums ''a'' + ''b'' + ''c'' and ''d'' + ''e'' + ''f'' should be even as well. The only way that the sum of three integers will result in an even number is when 1) two of them are odd and one is even, or 2) when all three are even. The fact that the two corner cells are even means that we have only 2 even numbers at our disposal. Thus, the second statement is not compatible with this fact. Hence, it must be the case that the first statement is true: two of the three numbers should be odd, while one be even.

Now let ''a, b, d, e'' be odd numbers while ''c'' and ''f'' be even numbers. Given the odd bone numbers at our disposal: ± 5, ± 7, ± 9, and ± 11, their differences range from ''D'' = while their sums range from ''S'' = . It is also useful to have a table of their sum and differences for later reference. Now, given the corner cells (''u'', ''v''), we can check its admissibility by checking if the sums ''u'' + ''v'' + ''c'' and ''v'' + ''u*'' + ''f'' fall within the set ''D'' or ''S''. The admissibility of the corner numbers is a necessary but not a sufficient condition for the solution to exist.

For example, if we consider the pair (''u'', ''v'') = (8, 12), then ''u'' + ''v'' = 20 and ''v'' + ''u*'' = 6; and we will have ± 6 and ± 10 even bone numbers at our disposal. Taking ''c'' = ± 6, we have the sum ''u'' + ''v'' + ''c'' to be 26 and 14, depending on the sign of ''± 6'' taken, both of which do not fall within the sets ''D'' or ''S''. Likewise, taking ''c'' = ± 10, we have the sum ''u'' + ''v'' + ''c'' to be 30 and 10, both of which again do not fall within the sets ''D'' or ''S''. Thus, the pair (8, 12) is not admissible. By similar process of reasoning, we can also rule out the pair (6, 12).

As another example, if we consider the pair (''u'', ''v'') = (10, 12), then ''u'' + ''v'' = 22 and ''v'' + ''u*'' = 2; and we will have ± 6 and ± 8 even bone numbers at our disposal. Taking ''c'' = ± 6, we have the sum ''u'' + ''v'' + ''c'' to be 28 and 16. While 28 does not fall within the sets ''D'' or ''S'', 16 falls in set ''S''. By inspection, we find that if (''a'', ''b'') = (-7, -9), then ''a'' + ''b'' = -16; and it will satisfy the first constraint equation. Also, taking ''f'' = ± 8, we have the sum ''v'' + ''u*'' + ''f'' to be 10 and -6. While 10 does not fall within the sets ''D'' or ''S'', -6 falls in set ''D''. Since -7 and -9 have already been assigned to ''a'' and ''b'', clearly (''d'', ''e'') = (-5, 11) so that ''d'' + ''e'' = 6; and it will satisfy the second constraint equation.

Likewise, taking ''c'' = ± 8, we have the sum ''u'' + ''v'' + ''c'' to be 30 and 14. While 30 does not fall within the sets ''D'' or ''S'', 14 falls in set ''S''. By inspection, we find that if (''a'', ''b'') = (-5, -9), then ''a'' + ''b'' = -14. Also, taking ''f'' = ± 6, we have the sum ''v'' + ''u*'' + ''f'' to be 8 and -4. While 8 does not fall within the sets ''D'' or ''S'', -4 falls in set ''D''. Clearly, (''d'', ''e'') = (-7, 11) so that ''d'' + ''e'' = 4, and the second constraint equation will be satisfied.

Hence the corner pair (''u'', ''v'') = (10, 12) is admissible; and it admits two solutions: (a, b, c, d, e, f) = (-7, -9, -6, -5, 11, -8) and (a, b, c, d, e, f) = ( -5, -9, -8, -7, 11, -6). The finished skeleton squares are given below. The magic square is obtained by adding 13 to each cells.

Using similar process of reasoning, we can construct the following table for the values of ''u, v, a, b, c, d, e, f'' expressed as bone numbers as given below. There are only 6 possible choices for the corner cells, which leads to 10 possible border solutions.

Given this group of 10 borders, we can construct 10×8×(3!)² = 2880 essentially different bordered magic squares. Here the bone numbers ± 5, ..., ± 12 were consecutive. More bordered squares can be constructed if the numbers are not consecutive. If non-consecutive bone numbers were also used, then there are a total of 605 magic borders. Thus, the total number of order 5 essentially different bordered magic squares (with consecutive and non-consecutive numbers) is 174,240. See history. It is worth noting that the number of fifth-order magic squares constructible via the bordering method is about 26 times larger than via the superposition method.

Continuous enumeration methods

Exhaustive enumeration of all the borders of a magic square of a given order, as done previously, is very tedious. As such a structured solution is often desirable, which allows us to construct a border for a square of any order. Below we give three algorithms for constructing border for odd, doubly even, and singly even squares. These continuous enumeration algorithms were discovered in 10th century by Arab scholars; and their earliest surviving exposition comes from the two treatises by al-Buzjani and al-Antaki, although they themselves were not the discoverers. Since then many more such algorithms have been discovered.

Odd ordered squares: The following is the algorithm given by al-Buzjani to construct a border for odd squares. A peculiarity of this method is that for order ''n'' square, the two adjacent corners are numbers ''n - 1'' and ''n + 1''.

Starting from the cell above the lower left corner, we put the numbers alternately in left column and bottom row until we arrive at the middle cell. The next number is written in the middle cell of the bottom row just reached, after which we fill the cell in the upper left corner, then the middle cell of the right column, then the upper right corner. After this, starting from the cell above middle cell of the right column already filled, we resume the alternate placement of the numbers in the right column and the top row. Once half of the border cells are filled, the other half are filled by numbers complementary to opposite cells. The subsequent inner borders is filled in the same manner, until the square of order 3 is filled.

Below is an example for 9th-order square.

Doubly even order: The following is the method given by al-Antaki. Consider an empty border of order ''n'' = 4''k'' with ''k'' ≥ 3. The peculiarity of this algorithm is that the adjacent corner cells are occupied by numbers ''n'' and ''n - 1''.

Starting at the upper left corner cell, we put the successive numbers by groups of four, the first one next to the corner, the second and the third on the bottom, and the fourth at the top, and so on until there remains in the top row (excluding the corners) six empty cells. We then write the next two numbers above and the next four below. We then fill the upper corners, first left then right. We place the next number below the upper right corner in the right column, the next number on the other side in the left column. We then resume placing groups of four consecutive numbers in the two columns as before. Once half of the border cells are filled, the other half are filled by numbers complementary to opposite cells.

The example below gives the border for order 16 square.

For order 8 square, we just begin directly with the six cells.

Singly even order: For singly even order, we have the algorithm given by al-Antaki. Here the corner cells are occupied by ''n'' and ''n'' - 1. Below is an example of 10th-order square.

Start by placing 1 at the bottom row next to the left corner cell, then place 2 in the top row. After this, place 3 at the bottom row and turn around the border in anti-clockwise direction placing the next numbers, until ''n'' - 2 is reached on the right column. The next two numbers are placed in the upper corners (''n'' - 1 in upper left corner and ''n'' in upper right corner). Then, the next two numbers are placed on the left column, then we resume the cyclic placement of the numbers until half of all the border cells are filled. Once half of the border cells are filled, the other half are filled by numbers complementary to opposite cells.

Method of composition

For squares of order ''m × n'' where ''m'', ''n'' > 2

This is a method reminiscent of the Kronecker product of two matrices, that builds an ''nm'' × ''nm'' magic square from an ''n'' × ''n'' magic square and an ''m'' × ''m'' magic square.Hartley, M
"Making Big Magic Squares"
The "product" of two magic squares creates a magic square of higher order than the two multiplicands. Let the two magic squares be of orders ''m'' and ''n''. The final square will be of order ''m × n''. Divide the square of order ''m × n'' into ''m × m'' sub-squares, such that there are a total of ''n''² such sub-squares. In the square of order ''n'', reduce by 1 the value of all the numbers. Multiply these reduced values by ''m''², and place the results in the corresponding sub-squares of the ''m × n'' whole square. The squares of order ''m'' are added ''n''² times to the sub-squares of the final square. The peculiarity of this construction method is that each magic subsquare will have different magic sums. The square made of such magic sums from each magic subsquare will again be a magic square. The smallest composite magic square of order 9, composed of two order 3 squares is given below.

Since each of the 3×3 sub-squares can be independently rotated and reflected into 8 different squares, from this single 9×9 composite square we can derive 8⁹ = 134,217,728 essentially different 9×9 composite squares. Plenty more composite magic squares can also be derived if we select non-consecutive numbers in the magic sub-squares, like in Yang Hui's version of the 9×9 composite magic square. The next smallest composite magic squares of order 12, composed of magic squares of order 3 and 4 are given below.

For the base squares, there is only one essentially different 3rd order square, while there 880 essentially different 4th-order squares that we can choose from. Each pairing can produce two different composite squares. Since each magic sub-squares in each composite square can be expressed in 8 different forms due to rotations and reflections, there can be 1×880×8⁹ + 880×1×8¹⁶ ≈ 2.476×10¹⁷ essentially different 12×12 composite magic squares created this way, with consecutive numbers in each sub-square. In general, if there are ''c''_m and ''c''_n essentially different magic squares of order ''m'' and ''n'', then we can form ''c''_m × ''c''_n × ( 8^''m''2 + 8^''n''2) composite squares of order ''mn'', provided ''m'' ≠ ''n''. If ''m'' = ''n'', then we can form (''c''_m)² × 8^''m''2 composite squares of order ''m''².

For squares of doubly even order

When the squares are of doubly even order, we can construct a composite magic square in a manner more elegant than the above process, in the sense that every magic subsquare will have the same magic constant. Let ''n'' be the order of the main square and ''m'' the order of the equal subsquares. The subsquares are filled one by one, in any order, with a continuous sequence of ''m''²/2 smaller numbers (i.e. numbers less than or equal to ''n''²/2) together with their complements to ''n''² + 1. Each subsquare as a whole will yield the same magic sum. The advantage of this type of composite square is that each subsquare is filled in the same way and their arrangement is arbitrary. Thus, the knowledge of a single construction of even order will suffice to fill the whole square. Furthermore, if the subsquares are filled in the natural sequence, then the resulting square will be pandiagonal. The magic sum of the subsquares is related to the magic sum of the whole square by $M_m = \frac$ where ''n'' = ''km''.

In the examples below, we have divided the order 12 square into nine subsquares of order 4 filled each with eight smaller numbers and, in the corresponding bishop's cells (two cells diagonally across, including wrap arounds, in the 4×4 subsquare), their complements to ''n''² + 1 = 145. Each subsquare is pandiagonal with magic constant 290; while the whole square on the left is also pandiagonal with magic constant 870.

In another example below, we have divided the order 12 square into four order 6 squares. Each of the order 6 squares are filled with eighteen small numbers and their complements using bordering technique given by al-Antaki. If we remove the shaded borders of the order 6 subsquares and form an order 8 square, then this order 8 square is again a magic square. In its full generality, we can take any ''m''²/2 smaller numbers together with their complements to ''n''² + 1 to fill the subsquares, not necessarily in continuous sequence.

Medjig-method for squares of even order 2''n'', where ''n'' > 2

In this method a magic square is "multiplied" with a medjig square to create a larger magic square. The namesake of this method derives from mathematical game called medjig created by Willem Barink in 2006, although the method itself is much older. An early instance of a magic square constructed using this method occurs in Yang Hui's text for order 6 magic square. The LUX method to construct singly even magic squares is a special case of the medjig method, where only 3 out of 24 patterns are used to construct the medjig square.

The pieces of the medjig puzzle are 2×2 squares on which the numbers 0, 1, 2 and 3 are placed. There are three basic patterns by which the numbers 0, 1, 2 and 3 can be placed in a 2×2 square, where 0 is at the top left corner:

Each pattern can be reflected and rotated to obtain 8 equivalent patterns, giving us a total of 3×8 = 24 patterns. The aim of the puzzle is to take ''n''² medjig pieces and arrange them in an ''n'' × ''n'' ''medjig square'' in such a way that each row, column, along with the two long diagonals, formed by the medjig square sums to 3''n'', the magic constant of the medjig square. An ''n'' × ''n'' medjig square can create a 2''n'' × 2''n'' magic square where ''n'' > 2.

Given an ''n''×''n'' medjig square and an ''n''×''n'' magic square base, a magic square of order 2''n''×2''n'' can be constructed as follows:
* Each cell of an ''n''×''n'' magic square is associated with a corresponding 2×2 subsquare of the medjig square
* Fill each 2×2 subsquares of the medjig square with the four numbers from 1 to 4''n''² that equal the original number modulo ''n''², i.e. ''x''+''n''²''y'' where ''x'' is the corresponding number from the magic square and ''y'' is a number from 0 to 3 in the 2×2 subsquares.

Assuming that we have an initial magic square base, the challenge lies in constructing a medjig square. For reference, the sums of each medjig piece along the rows, columns and diagonals, denoted in italics, are:

Doubly even squares: The smallest even ordered medjig square is of order 2 with magic constant 6. While it is possible to construct a 2×2 medjig square, we cannot construct a 4×4 magic square from it since 2×2 magic squares required to "multiply" it does not exist. Nevertheless, it is worth constructing these 2×2 medjig squares. The magic constant 6 can be partitioned into two parts in three ways as 6 = 5 + 1 = 4 + 2 = 3 + 3. There exist 96 such 2×2 medjig squares. In the examples below, each 2×2 medjig square is made by combining different orientations of a single medjig piece.

We can use the 2×2 medjig squares to construct larger even ordered medjig squares. One possible approach is to simply combine the 2×2 medjig squares together. Another possibility is to wrap a smaller medjig square core with a medjig border. The pieces of a 2×2 medjig square can form the corner pieces of the border. Yet another possibility is to append a row and a column to an odd ordered medjig square. An example of an 8×8 magic square is constructed below by combining four copies of the left most 2×2 medjig square given above:

The next example is constructed by bordering a 2×2 medjig square core.

Singly even squares: Medjig square of order 1 does not exist. As such, the smallest odd ordered medjig square is of order 3, with magic constant 9. There are only 7 ways of partitioning the integer 9, our magic constant, into three parts. If these three parts correspond to three of the medjig pieces in a row, column or diagonal, then the relevant partitions for us are:

: 9 = 1 + 3 + 5 = 1 + 4 + 4 = 2 + 3 + 4 = 2 + 2 + 5 = 3 + 3 + 3.

A 3×3 medjig square can be constructed with some trial-and-error, as in the left most square below. Another approach is to add a row and a column to a 2×2 medjig square. In the middle square below, a left column and bottom row has been added, creating an L-shaped medjig border, to a 2×2 medjig square given previously. The right most square below is essentially same as the middle square, except that the row and column has been added in the middle to form a cross while the pieces of 2×2 medjig square are placed at the corners.

Once a 3×3 medjig square has been constructed, it can be converted into a 6×6 magic square. For example, using the left most 3×3 medjig square given above:

There are 1,740,800 such 3×3 medjig squares. An easy approach to construct higher order odd medjig square is by wrapping a smaller odd ordered medjig square with a medjig border, just as with even ordered medjig squares. Another approach is to append a row and a column to an even ordered medjig square. Approaches such as the LUX method can also be used. In the example below, a 5×5 medjig square is created by wrapping a medjig border around a 3×3 medjig square given previously:

Solving partially completed magic squares

Solving partially completed magic squares is a popular mathematical pastime. The techniques needed are similar to those used in Sudoku or KenKen puzzles, and involve deducing the values of unfilled squares using logic and permutation group theory (Sudoku grids are ''not'' magic squares but are based on a related idea called Graeco-Latin squares).

Variations of the magic square

Extra constraints

Certain extra restrictions can be imposed on magic squares.

If raising each number to the ''n''th power yields another magic square, the result is a bimagic (n = 2), a trimagic (n = 3), or, in general, a multimagic square.

A magic square in which the number of letters in the name of each number in the square generates another magic square is called an alphamagic square.

There are magic squares consisting entirely of primes. Rudolf Ondrejka (1928–2001) discovered the following 3×3 magic square of primes, in this case nine Chen primes:

The Green–Tao theorem implies that there are arbitrarily large magic squares consisting of primes.

The following "reversible magic square" has a magic constant of 264 both upside down and right way up:

When the extra constraint is to display some date, especially a birth date, then such magic squares are called birthday magic square. An early instance of such birthday magic square was created by Srinivasa Ramanujan. He created a 4×4 square in which he entered his date of birth in DD-MM-CC-YY format in the top row and the magic happened with additions and subtractions of numbers in squares. Not only do the rows, columns, and diagonals add up to the same number, but the four corners, the four middle squares (17, 9, 24, 89), the first and last rows two middle numbers (12, 18, 86, 23), and the first and last columns two middle numbers (88, 10, 25, 16) all add up to the sum of 139.

Multiplicative magic squares

Instead of ''adding'' the numbers in each row, column and diagonal, one can apply some other operation. For example, a multiplicative magic square has a constant ''product'' of numbers. A multiplicative magic square can be derived from an additive magic square by raising 2 (or any other integer) to the power of each element, because the logarithm of the product of 2 numbers is the sum of logarithm of each. Alternatively, if any 3 numbers in a line are 2^''a'', 2^''b'' and 2^''c'', their product is 2^{''a''+''b''+''c''}, which is constant if ''a''+''b''+''c'' is constant, as they would be if ''a'', ''b'' and ''c'' were taken from ordinary (additive) magic square. For example, the original Lo-Shu magic square becomes:

Other examples of multiplicative magic squares include:

Multiplicative magic squares of complex numbers

Still using Ali Skalli's non iterative method, it is possible to produce an infinity of multiplicative magic squares of complex numbers belonging to $\mathbb C$ set. On the example below, the real and imaginary parts are integer numbers, but they can also belong to the entire set of real numbers $\mathbb R$.
The product is: −352,507,340,640 − 400,599,719,520 ''i''.

Additive-multiplicative magic and semimagic squares

Additive-multiplicative magic squares and semimagic squares satisfy properties of both ordinary and multiplicative magic squares and semimagic squares, respectively.

It is unknown if any additive-multiplicative magic squares smaller than 8×8 exist, but it has been proven that no 3×3 or 4×4 additive-multiplicative magic squares and no 3×3 additive-multiplicative semimagic squares exist.

Geometric magic squares

Magic squares may be constructed which contain geometric shapes instead of numbers. Such squares, known as geometric magic squares, were invented and named by Lee Sallows in 2001.

In the example shown the shapes appearing are two dimensional. It was Sallows' discovery that ''all'' magic squares are geometric, the numbers that appear in numerical magic squares can be interpreted as a shorthand notation which indicates the lengths of straight line segments that are the geometric 'shapes' occurring in the square. That is, numerical magic squares are that special case of a geometric magic square using one dimensional shapes.Les carrés magiques géométriques
by Jean-Paul Delahaye, ''Pour La Science'' No. 428, June 2013

Area magic squares

In 2017, following initial ideas o
William Walkington
an
Inder Taneja
the first linear area magic square (L-AMS) was constructed by Walter Trump.

Other magic shapes

Other two dimensional shapes than squares can be considered. The general case is to consider a design with ''N'' parts to be magic if the ''N'' parts are labeled with the numbers 1 through ''N'' and a number of identical sub-designs give the same sum. Examples include magic circles, magic rectangles, magic trianglesMagic Designs, Robert B. Ely III, Journal of Recreational Mathematics volume 1 number 1, January 1968 magic stars, magic hexagons, magic diamonds. Going up in dimension results in magic spheres, magic cylinders, magic cubes, magic parallelepiped, magic solids, and other magic hypercubes.

Possible magic shapes are constrained by the number of equal-sized, equal-sum subsets of the chosen set of labels. For example, if one proposes to form a magic shape labeling the parts with , the sub-designs will have to be labeled with and .

Related problems

''n''-Queens problem

In 1992, Demirörs, Rafraf, and Tanik published a method for converting some magic squares into ''n''-queens solutions, and vice versa.

Magic squares in occultism

Magic squares of order 3 through 9, assigned to the seven planets, and described as means to attract the influence of planets and their angels (or demons) during magical practices, can be found in several manuscripts all around Europe starting at least since the 15th century. Among the best known, the ''Liber de Angelis'', a magical handbook written around 1440, is included in Cambridge Univ. Lib. MS Dd.xi.45. The text of the ''Liber de Angelis'' is very close to that of ''De septem quadraturis planetarum seu quadrati magici'', another handbook of planetary image magic contained in the Codex 793 of the Biblioteka Jagiellońska (Ms BJ 793). The magical operations involve engraving the appropriate square on a plate made with the metal assigned to the corresponding planet, as well as performing a variety of rituals. For instance, the 3×3 square, that belongs to Saturn, has to be inscribed on a lead plate. It will, in particular, help women during a difficult childbirth.

In about 1510 Heinrich Cornelius Agrippa wrote ''De Occulta Philosophia'', drawing on the Hermetic and magical works of Marsilio Ficino and Pico della Mirandola. In its 1531 edition, he expounded on the magical virtues of the seven magical squares of orders 3 to 9, each associated with one of the astrological planets, much in the same way as the older texts did. This book was very influential throughout Europe until the counter-reformation, and Agrippa's magic squares, sometimes called kameas, continue to be used within modern ceremonial magic in much the same way as he first prescribed.

The most common use for these kameas is to provide a pattern upon which to construct the sigils of spirits, angels or demons; the letters of the entity's name are converted into numbers, and lines are traced through the pattern that these successive numbers make on the kamea.
In a magical context, the term ''magic square'' is also applied to a variety of word squares or number squares found in magical grimoires, including some that do not follow any obvious pattern, and even those with differing numbers of rows and columns. They are generally intended for use as talismans. For instance the following squares are: The Sator square, one of the most famous magic squares found in a number of grimoires including the '' Key of Solomon''; a square "to overcome envy", from ''The Book of Power''; and two squares from '' The Book of the Sacred Magic of Abramelin the Mage'', the first to cause the illusion of a superb palace to appear, and the second to be worn on the head of a child during an angelic invocation:

Magic squares in popular culture

* In Goethe's Faust, the witch's spell used to make a youth elixir for Faust, the ', has been interpreted as a construction of a magic square.
* The English composer Peter Maxwell Davies has used magic squares to structure many of his compositions. For example, his 1975 ''Ave Maris Stella'' uses the 9×9 magic square of Moon while his 1977 ''A Mirror of Whitening Light'' uses the 8×8 magic square of Mercury to create the entire set of notes and durations for the piece. His other works that employ magic squares include ''The Lighthouse'' (1979), ''Resurrection'' (1987), ''Strathclyde Concerto No. 3 for Horn and Trumpet'' (1989), as well as many of his symphonies. According to Davies' own account:

A magic square in a musical composition is not a block of numbers – it is a generating principle, to be learned and known intimately, perceived inwardly as a multi-dimensional projection into that vast (chaotic!) area of the internal ear – the space/time crucible – where music is conceived. ... Projected onto the page, a magic square is a dead, black conglomeration of digits; tune in, and one hears a powerful, orbiting dynamo of musical images, glowing with numen and lumen.

* Magic squares, including Benjamin Franklin's, appear as clues to the mystery in Katherine Neville's novels '' The Eight'' and '' The Fire''.
* Magic squares play a role in Steve Martin's 2003 novel '' The Pleasure of My Company''.
* Dürer's magic square and his ''Melencolia I'' both also played large roles in Dan Brown's 2009 novel, '' The Lost Symbol''.
* In the 2011 Korean television drama '' Deep Rooted Tree'', King Sejong is shown attempting to construct a 33×33 magic square using lunch boxes. He ultimately discovers the "pyramid method" and completes the magic square with the help of an army of court attendants. This inspires him to create a more just form of government ruled by reason and words rather than military might.
* On October 9, 2014 the post office of Macao in the People's Republic of China issued a series of stamps based on magic squares. The figure below shows the stamps featuring the nine magic squares chosen to be in this collection.Macau's magic square stamps just made philately even more nerdy
The Guardian Science, November 3, 2014
* The metallic artifact at the center of ''The X-Files'' episode " Biogenesis" is alleged by Chuck Burks to be a magic square.
* Mathematician Matt Parker attempted to create a 3×3 magic square using square numbers in a YouTube video on the Numberphile channel. His failed attempt is known as the Parker Square.
* The first season Stargate Atlantis episode "Brotherhood" involves completing a magic square as part of a puzzle guarding a powerful Ancient artefact.
* Magic Squares are also featured in the 2019 Spanish film ''Vivir dos veces''.

See also

* Antimagic square
* Arithmetic sequence
* Associative magic square
* Combinatorial design
* Freudenthal magic square
* John R. Hendricks
* Hexagonal tortoise problem
* Latin square
* Magic circle
* Magic cube classes
* Magic polygon
* Magic series
* Most-perfect magic square
* Nasik magic hypercube
* Prime reciprocal magic square
* Room square
* Square matrices
* Sigil (magic)
* Sriramachakra
* Sudoku
* Unsolved problems in mathematics
* Vedic square

Notes

References

*

Magic Squares
a
Convergence

* John Lee Fults, ''Magic Squares''. (La Salle, Illinois: Open Court, 1974).
* Cliff Pickover, ''The Zen of Magic Squares, Circles, and Stars'' (Princeton, New Jersey: Princeton University Press)
* Leonhard Euler,
On magic squares
'
* Leonhard Euler,
Investigations on new type of magic square
'


and Oswald Jacoby, "New Recreations with Magic Squares". (New York: Dover, 1976).

Further reading

*
*
*
*
*
*

External links

*

{{DEFAULTSORT:Magic Square

Matrices
Chinese mathematical discoveries
Unsolved problems in mathematics
Magic symbols