The smallest possible additive-multiplicative magic square


What is the smallest possible additive-multiplicative (or addition-multiplication) magic square? 5x5, 6x6, 7x7, or 8x8: today nobody knows!

Reminder: an additive-multiplicative magic square has to be magic when we add the cells of any line (same sum S), and has to be also magic when we multiply the cells of any line (same product P). All the used integers have to be distinct. The smallest known additive-multiplicative magic squares are 8x8 and 9x9 squares, first constructed by Walter Horner in the 50's. In 2005, I constructed other 8x8 and 9x9 squares with smaller magic products and smaller magic sums than the Horner's squares: they are still the best known add-mult magic squares.

Here is the status on the subject, most of the results ≤ 7 coming from Lee Morgenstern, USA.


3x3 add-mult magic squares?

Semi-magic and magic squares are impossible. Here is the demonstration given by Lee Morgenstern.

Duplication Lemma
Given
     a + b = c + d
and
     ab = cd,
then
     c = a or c = b.

Proof
Use the 2nd equation and set d = ab/c. Substitute this into the 1st equation to get
     a + b = c + ab/c
or
     c(a + b) = c^2 + ab
or
     (c - a)(c - b) = 0.

 Thus c = a or c = b.

Theorem
A 3x3 add-mult semi-magic square of distinct entries is impossible.

Proof
Suppose the following is a 3x3 add-mult semi-magic square.
     a b M
     N P c
     Q R d

 Because the square is additive semi-magic, we have
         a + b + M = M + c + d
or
     (1) a + b = c + d.

 Because the square is multiplicative semi-magic, we have
         abM = Mcd
or
     (2) ab = cd.

From (1) and (2) and the Duplication Lemma, all 3x3 add-mult semi-magic squares must have duplicate entries.

Corollary
A 3x3 add-mult magic square of distinct entries is impossible.


4x4 add-mult magic squares?

4x4 add-mult semi-magic squares are possible. Lee Morgenstern found 54 semi-magic examples with Max nb < 256, the best possible being:

But 4x4 add-mult magic squares are impossible, as proved below by Lee.

Theorem
A 4x4 add-mult magic square of distinct entries is impossible.

Proof
Suppose the following is a 4x4 add-mult magic square.
     a M N b
     P Q R S
     T U V W
     X c d Y

 Because the square is additive magic, we have
     (1)  a + M + N + b = X + c + d + Y,
     (2)  a + Q + V + Y = M + Q + U + c,
     (3)  b + R + U + X = N + R + V + d.

 Add (1), (2), and (3), cancel common terms, and divide by 2,
     (4)  a + b = c + d.

 Because the square is multiplicative magic, we have
     (5)  aMNb = XcdY
     (6)  aQVY = MQUc
     (7)  bRUX = NRVd

 Multiply (5), (6), and (7),
          MNQRUVXY(ab)^2 = MNQRUVXY(cd)^2
or
     (8)  ab = cd.

 From (4) and (8) and the Duplication Lemma, all 4x4 add-mult magic squares must have duplicate entries.


5x5 add-mult magic squares?

We don't know if 5x5 add-mult magic squares are possible. But 5x5 add-mult semi-magic squares are possible. Lee Morgenstern found 15 semi-magic examples with Max nb < 256. Here is the square having the smallest possible Max nb. It has a very interesting supplemental property: it is also an additive panmagic square, the sums of all its broken diagonals giving again the same S.

Here is the square having the smallest S and the smallest P:

But his very best square is this other one. Better than an add-mult semi-magic square, because it has one add-mult magic diagonal (and always 5 add-mult magic rows, and 5 add-mult magic columns). Very close to a 5x5 add-mult magic square!

Results of the search done by Lee Morgenstern in 2007: there is no magic example with Max nb < 259.
And results of my own search of February 2009: there is no magic example with Max nb < 1000 and P < 10^9 * center cell.

Who will be the first to construct a 5x5 add-mult magic square? Or prove that it is impossible?


6x6 add-mult magic squares?

In 2005, I constructed a 6x6 multiplicative magic square with partial add-mult properties: its 6 rows are additive-multiplicative. In 2007, Lee Morgenstern constructed the first known 6x6 add-mult semi-magic squares. Here are the best possible semi-magic examples. The first square has one additive magic diagonal. And the second square has one additive magic diagonal and one multiplicative magic diagonal.



Interesting observation on the previous square: it uses the first consecutive integers 1, 2, 3, 4, 5, 6, 7. Not fully sure that this square has the smallest possible P, but it has the smallest known P.

We don't know if 6x6 add-mult magic squares are possible. The second square above (Smallest S = 289) has 13 of 14 correct sums, and 13 of 14 correct products: total 26 out of 28, not an additive magic square, and not a multiplicative magic square. Here is a square with 14 of 14 correct sums, and 12 of 14 correct products: still 26 out of 28, still not a multiplicative magic square, but this is now an additive magic square!

Results of the search done by Lee Morgenstern in 2007: there is no magic example with Max nb < 136.

Who will be the first to construct a 6x6 add-mult magic square? Or prove that it is impossible?


7x7 add-mult magic squares?

In 2005, I constructed a 7x7 multiplicative magic square with partial add-mult properties: its 7 rows are additive-multiplicative. We don't know any 7x7 add-mult semi-magic square. Results of the search done by Lee Morgenstern in 2007: there is no semi-magic example with Max nb < 91.

Who will be the first to construct a 7x7 add-mult semi-magic square?

And we don't know if 7x7 add-mult magic squares are possible.

Who will be the first to construct a 7x7 add-mult magic square? Or prove that it is impossible?


8x8 and 9x9 add-mult magic squares?

Examples are known. Look at this other page.


Return to the home page http://www.multimagie.com