Ad
  • Custom User Avatar

    ran into the same problem, you'll have to find another way to run this in less iterations! Not sure what your solution is, I know the easy way out is checking to see if the number N modulo'd by 2...3...4...N-2...N-1, but this takes way too many iterations with large numbers.

    Another scenario you might be running into (which I ran into) was keeping an array of prime numbers within the bounds, this also gets really large and requires a large amount of iterations, try not using an array of prime numbers if yo uare doing so.