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.
Runtime: 0
Average: 0 Runs: 0
SD: 0 ms
Max: 0
Min: 1000
To solve this, I used a while loop that incremented Fibonacci numbers
that stopped after my Fibonacci number reached 4,000,000.
If the number mod 2 was equal to 0 (even number) I added the value of
that number to a "sum" variable.
###,###