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.)

I agree with the respective observations made by Charlie and Sing4TheDay that the following is the smallest muliplicative magic square (disregarding the reflections and rotations) which satisfy the conditions of the problem.

2....36...3

9.....6....4

12...1...18

*Edited on ***May 20, 2007, 2:44 pm**