-
Notifications
You must be signed in to change notification settings - Fork 0
/
Problem002.java
32 lines (27 loc) · 948 Bytes
/
Problem002.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
/**
* 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.
*/
public class Problem002 {
private static int sumEvenFibonacciNumbers(int limit) {
int sum = 0;
int prev2 = 0, prev1 = 1;
int f = prev1 + prev2;
while (f < limit) {
if (f%2 == 0) {
sum += f;
}
prev2 = prev1;
prev1 = f;
f = prev1 + prev2;
}
return sum;
}
public static void main(String[] args) {
System.out.println("The sum of the even-valued Fibonacci numbers (under 4 million) is:");
System.out.println(sumEvenFibonacciNumbers(4000000));
}
}