Project Euler #49: Prime permutations

  • + 0 comments

    If you are having timout issues, I recommend implementing sieve to get the relevant prime numbers, and using itertools permutations. The key is not to run itertools on every prime. As you go along, apply the same permutation list to all the primes in the list to optimize speed. I recommend splicing only the larger primes. Good luck!