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 [15]:
fib = [0,1]
index = 1
while fib[index] < 4000000:
fib.append(fib[index] + fib[index-1])
index += 1
sum([f for f in fib if f % 2 == 0])
Out[15]:
In [ ]:
# This cell will be used for grading, leave it at the end of the notebook.