Project Euler Problem 2 Solution

First posted on 09/09/2012

Question

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, …

Find the sum of all the even-valued terms in the sequence which do not exceed four million.

Solution in Java

public class Quest2 {
	public static void main(String[] args) {
		int x = 0;
		int y = 1;
		int z;
		int sum = 0;

		do {
		    z = x + y;
		    x = y;
		    y = z;
		    if (y % 2 == 0) sum += y;
		} while (y <= 4000000);

		
		System.out.println(sum);
	}
}

Answer: 4,613,732

Show Comments

Get the latest posts delivered right to your inbox.