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
Although the question asks for the largest prime factor, it doesn't necessarily mean you have to find that one first...