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.)
 A possible solution | Comment 1 of 5
A possible  solution:

423

442

334    and rotations/reflections

Sum: 29

 Posted by Ady TZIDON on 2010-05-07 13:21:12
Please log in:
 Login: Password: Remember me: Sign up! | Forgot password

 Search: Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (4)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2018 by Animus Pactum Consulting. All rights reserved. Privacy Information