Projecteuler.net – Problem 2 – Java solution

http://projecteuler.net/problem=2

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 Solution.

	private static int euler002() {
		int a = 1;
		int b = 2;
		int c = 0;
		int sum = 0;

		while (c < 4000000) {
			if (b%2 == 0) {
				sum += b;
			}
			c = a + b;
			a = b;
			b = c;
		}
		return sum;
	}
This entry was posted in Java, Project Euler. Bookmark the permalink.

Leave a Reply