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

 Self-Cardinality (Posted on 2010-05-07)
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?

 See The Solution Submitted by Charlie Rating: 3.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
 re(2): A possible solution | Comment 4 of 5 |
(In reply to re: A possible solution by Daniel)

IMHO,  the problem did not enforce using none of the digits.

There might be some ambiguity, but the assumption that a solution  exists caused my interpretation: do not use all the digits includ4ed in the matrix

 Posted by Ady TZIDON on 2010-05-07 17:39:12

 Search: Search body:
Forums (0)
Random Problem
Site Statistics
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox: