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?

 See The Solution Submitted by Ady TZIDON No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
 re: computer result: 11 solutions and two almost-solutions | Comment 2 of 3 |
(In reply to computer result: 11 solutions and two almost-solutions by Charlie)

I like very much the way you handled the solution  i.e. a non-exhaustive, heuristic approach.

However , if your goal was to list all the solutions  - I will show tou one (and there might be others) that you've missed:

2,37,169 & 4058.

Please use this set as a guidance to fully debug your program and throw away the "asterisk solutions".

 Posted by Ady TZIDON on 2012-05-18 17:35:56

 Search: Search body:
Forums (0)