You are viewing a single comment's thread. Return to all comments →
It's a quite difficult problem. It involves efficient factorization and primes checking and memoization.
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #248: Numbers for which Euler’s totient function equals 13!
You are viewing a single comment's thread. Return to all comments →
It's a quite difficult problem. It involves efficient factorization and primes checking and memoization.