# Project Euler | Problem 2 | Even Fibonacci numbers

##
__Problem Description__ :

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.

##
__Concept__ :

In Fibonacci sequence, each Fibonacci term is a sum of previous two terms.

For example - F(N)=F(N-2)+F(N-1)

##
__Java Program__ :

##
__Output__ :

Output - Project Euler Problem 2 |

##
__References__ :

*Thank you friends, I hope you have clearly understood the solution of this problem. If you have any doubt, suggestion or query please feel free to comment below. You can also discuss this solution in our forum.***Tags : Project Euler Problem 2 Solution, Mathematics problems, Fibonacci numbers, Solution in Java, List, ArrayList, if statement, Dynamic programming, While loop.**

Project Euler | Problem 2 | Even Fibonacci numbers
Reviewed by Rohit Agarwal
on
10/24/2016
Rating:

## No comments:

Please provide your valuable comments. If you have any suggestion please share with me I will work on it and if you have any question or doubt please ask, don't hesitate. I am your friend, i will clarify all your doubts.