Arrange nine digits in a 3x3 array such that each different digit that appears appears as many times as its cardinality, so for example, if the digit 3 appears at all, it appears 3 times. Also the eight 3-digit numbers formed from the rows, columns (top to bottom) and two diagonals (also top to bottom) must all be different.

Also, the sum of the nine digits used cannot itself be written using the digits you've included in the array.

What is that sum of these nine digits?

(In reply to re(2): A possible solution by Ady TZIDON)

yes, I agree.  It has always been my rule that when the math is right but the answer is not, you must first check your assumptions :-). 

Posted by Daniel on 2010-05-08 01:05:47