Project Euler Question 3 Help

Question

I\'m trying to work through Project Euler and I\'m hitting a barrier on problem 03. I have an algorithm that works for smaller numbers, but problem 3 uses a very, very large

Answer 1

Try using the Miller-Rabin Primality Test to test for a number being prime. That should speed things up considerably.