Question

Possible Duplicate:
Project Euler, Problem 10 java solution not working

So, I’m attempting to solve Project Euler Problem 10 in Java, and I’m getting not the right answer. Here’s my code:

public class Problem10 {
public static void main(String[] args)
{
    long sum =0;
    for(int i =3;i<2000000;i+=2)
    {
        if(isPrime(i))
        {
            sum+=i;
        }
    }
    System.out.println(sum);
}

public static boolean isPrime(int n)
{
    boolean prime = true;
    if (n<2) return false;
    if (n==2) return true;
    if (n%2==0) return false;
    for (int i = 3; i<=Math.sqrt(n);i+=2)
    {
        if (n%i==0)
        {
            prime=false;
            break;
        }
    }
    return prime;
}
}

Which prints out 142913828920, which project Euler tells me is wrong.

Any ideas?

(Also, I know my method for finding primes is terribly inefficient.)

Answer 1

for(int i =3;i<2000000;i+=2)

2 is prime.