Project Euler – Problem 10

The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17. Find the sum of all the primes below two million.

计算2000000一下的素数和，参照problem 7判断素数的办法。

static long sumOfPrimes(int n)
{
    long sum = 17;
    for (int i = 11; i < n; i += 2)
    {
        if (isPrime(i))
        {
            sum += i;
        }
    }
    return sum;
}

static bool isPrime(int n)
{
    if (n % 3 == 0)
    {// 大于3的素数可以表示为6k+1或6k-1
        return false;
    }

    int r = (int)Math.Sqrt(n);
    int f = 5;
    while (f <= r)
    {
        if (n % f == 0)
        {
            return false;
        }
        if (n % (f + 2) == 0)
        {// 6k-1变成6k+1，5轮后变回6k-1
            return false;
        }
        f += 6;
    }
    return true;
}