You are viewing a single comment's thread. Return to all comments →
(a) Prime sieve up to 10^7
(b) Look for primes nearest to 10^(N - 1) and go up
(c) Assemble masks by recursion, ensuring along the way that all replaced digits are equal
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #51: Prime digit replacements
You are viewing a single comment's thread. Return to all comments →
(a) Prime sieve up to 10^7
(b) Look for primes nearest to 10^(N - 1) and go up
(c) Assemble masks by recursion, ensuring along the way that all replaced digits are equal