Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 0 and 1, the first 12 terms will be:
0, 1, 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.
In [2]:
fibNums = [0, 1]
length = 1
maxn = 4000000
while (fibNums[length] <= maxn):
fibNums.append(fibNums[length] + fibNums[length-1])
length += 1
sum([y for y in fibNums if (y % 2 == 0)])
#raise NotImplementedError()
Out[2]:
In [ ]:
# This cell will be used for grading, leave it at the end of the notebook.