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?
(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".
re: computer result: 11 solutions and two almost-solutions
