All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars
 perplexus dot info

 Power of Multiplication (Posted on 2004-07-16)
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.)

 No Solution Yet Submitted by red_sox_fan_032003 Rating: 4.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
 re: Solution -- observation | Comment 2 of 6 |
(In reply to Solution by Sing4TheDay)

The given mmagic square (mult. magic square),

` 2  36   3 9   6   412   1  18`

can be described in terms of its number of factors that are 2 and that are 3 as two separate additive magic squares:

`1 2 00 1 22 0 1`

and

`0 2 12 1 01 0 2`

the first being powers of 2 and the second powers of 3.

 Posted by Charlie on 2004-07-16 11:53:08

 Search: Search body:
Forums (0)