Quote:
Originally Posted by dg211
I get the same answers for n = 9, d = 7 and n = 10, d = 8. It is possible to do it with a lot less computation  my single threaded C++ code took about 3.5s for n = 9, d = 7 and about 32s for n = 10, d = 8. Almost all of the time for n = 10 (like 31.9s) was spent generating a list of 8 digit primes.

Maybe you can post your solution next month (after the solution is posted on IBM site).