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

 A number pyramid (Posted on 2012-05-18)
Divide a set of 10 distinct digits into 4 subsets, each containing a different number of digits, adhering to the following conditions:

Two sets contain digits that can form a reversible prime, in the third set one can create a reversible square number and the remaining set has exactly one member twice as big as another.

Obeying the above restrictions do we get two distinct solutions - as I hope - or more?

 Submitted by Ady TZIDON No Rating Solution: (Hide) There are 11 distinct solutions. See excellent presentation in Charlie's second post.

 Subject Author Date re(2): computer result: 11 solutions and two almost-solutions Charlie 2012-05-18 18:09:20 re: computer result: 11 solutions and two almost-solutions Ady TZIDON 2012-05-18 17:35:56 computer result: 11 solutions and two almost-solutions Charlie 2012-05-18 15:16:23

 Search: Search body:
Forums (1)