A (normal) magic square, containing 9 distinct positive integers, could be made as follows:
2 9 4
7 5 3
6 1 8
Note all rows/columns/diagonals sum to 15.

Can you find the "smallest" multiplication magic square using 9 distinct positive integers where the product of all rows/columns/diagonals are equal?

(One multiplication magic square is smaller than another if its magic product is less than the other's.)

Given any magic square, changing all numbers X to A^X for any A will produce a multiplicative magic square, so there are infinite such squares.

Posted by Federico Kereki on 2004-07-16 18:32:27