Perl: the Markov chain saw | |
PerlMonks |
comment on |
( [id://3333]=superdoc: print w/replies, xml ) | Need Help?? |
Actually, when a bit of analysis, it's really easy to come
up with those numbers that have unique 6 terms solutions.
A 6 term solution is of the form:
But this can be rewritten as:
But this is equivalent with:
So, all you need to find are (x, y, z) such that there is no (k, l) for which ((x - k), (y - l), (z + k + l)) has no duplicates, are less than 10, and 0 or more, and the sum is large enough that there are no solutions with less terms available. This leads to (9, 8, 7) and (9, 8, 6) as the solutions, and hence to 5328 and 5106 and the only numbers with unique, and six term, solutions. A simular argument shows that for the four digit problem, only 193314 and 199980 have unique, 24 term solutions. And for five digits, we have unique 120 term solutions for 9066576 and 9333240. Abigail In reply to Re: Coming soon: Algorithm::Loops (another analysis of the puzzle)
by Abigail-II
|
|