The Sieve of Eratosthenes

I had some more fun with Project Euler problems, the important thing I found about those problems is they have a classical mathematical theory/method behind them, but they always have a twist that you must optimise the code or push your boundaries of coding comfort to get a result out.

The question that I was working on at my lunch break yesterday was:

"The prime factors of 13195 are 5, 7, 13 and 29.

 What is the largest prime factor of the number 600851475143 ? "

So I broke it down into three steps

To find all the primes numbers in a set of numbers iteratively there is an algorithm from classical mathematics called the Sieve of Eratosthenes (Sounds like something from Jason and the Argonauts, right?). This iteratively moves through the set from the first prime "2" and removes each primes multiples from the set. Then once you reach the arbitrarily large number only the primes remain. However I had trouble doing this in c# as in a foreach loop you can't remove items from the list while its iterating through it, if you do it gets a big fat error.

There probably is a way to do it with a different type of loop I just couldn't figure it out.

So instead I went for something, that probably doesn't perform so great:

Here's the code for the console app

 class Program {
        //Give a true or false if a number is a prime
        static bool IsPrimeNumber(Int64 num) {
            bool boolprime = true;
            Int64 factor = num / 2;
            Int64 i = 0;
            for (i = 2; i <= factor; i++) {
                if ((num % i) == 0) {
                    boolprime = false;
            return boolprime;
        static void Main(string[] args) {
            //Set the number that you want to find the prime factors
            const Int64 max = 600851475143;
            for (Int64 p = 2; p < max; p++) {
                if (IsPrimeNumber(p) == true) {
                    if ((max % p) == 0) {