# Project Euler Problem #2 Solution in Java

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.

/**

* @author Khuram Ali

*/

public class Problem2

{

public static void main(String[] args)

{

int term_1 = 1;

int term_2 = 2;

int term_3 = 0;

int sum = 0;

long MaxTerm = 4000000;

while (term_1 <= MaxTerm)

{

System.out.println (term_1);

if ((term_1 %2) == 0){sum += term_1;}

term_3 = term_1 + term_2;

term_1 = term_2;

term_2 = term_3;

}

System.out.println (“the sum of even value numbers is: “);

System.out.println (sum);

}

}

###### Related articles

- Project Euler: Problem #2 solution in C++ (alikhuram.wordpress.com)
- Project Euler Problem #1 Solution in Java (alikhuram.wordpress.com)
- C++, Fibonacci Sequence, Largest Value (daniweb.com)
- Project Euler: Problem #1 solution in C++ (alikhuram.wordpress.com)
- Project Euler Problem #4 C++ solution: (alikhuram.wordpress.com)
- Project Euler: Problem # 3 solution in C++ (alikhuram.wordpress.com)

Posted on March 26, 2013, in Java, Project Euler and tagged Fibonacci, Fibonacci number, Project Euler, Project Euler Solutions in Java. Bookmark the permalink. 1 Comment.

Pingback: Project Euler Problem# 6 solution in C++ | Khuram Ali