Welcome to the Java Programming Forums

The professional, friendly Java community. 21,500 members and growing!

The Java Programming Forums are a community of Java programmers from all around the World. Our members have a wide range of skills and they all have one thing in common: A passion to learn and code Java. We invite beginner Java programmers right through to Java professionals to post here and share your knowledge. Become a part of the community, help others, expand your knowledge of Java and enjoy talking with like minded people. Registration is quick and best of all free. We look forward to meeting you.

>> REGISTER NOW TO START POSTING

# Thread: Project Euler Questio 2

1. ## Project Euler Questio 2

Here is the problem::::::::::::

Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:

1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...

By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.

My Code:

import java.io.*;

class pro2
{
public static void main(String args[])
{
int a=1,b=2,c=0,sum=0;
while(c<=4000000)
{
c=a+b;
if((c%2)==0)
{sum+=c;}
a=b;
b=c;
}
System.out.println(sum);

}
}

2. ## Re: Project Euler Questio 2

Hello goldenpsycho!
The only problem I can see with your code is that you start adding to sum the even prime numbers after three. i.e you don't add prime number 2 to your sum. Just add 2 to your sum and you will get what you want.
Hope this helps.

3. ## The Following User Says Thank You to andreas90 For This Useful Post:

goldenpsycho (June 12th, 2012)

4. ## Re: Project Euler Questio 2

Hi andread90, thank you so much for your help. i can't believe that i overlooked such a small thing. I had written this program 3 times before coming to this conclusion so i guess i lost a bit of patience.