Project Euler: Problem 2

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 [17]:

    
#defining the variable fibonacci_seq

fibonacci_seq = [0,1]
i = 1

#While loop!!! 

while fibonacci_seq[i] < 4000000:
    fibonacci_seq.append(fibonacci_seq[i]+fibonacci_seq[i-1])
    i += 1

print(fibonacci_seq)
#This prints out a number larger than 4000000... I have to get rid of that









    



[0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418, 317811, 514229, 832040, 1346269, 2178309, 3524578, 5702887]



In [27]:

    
#Getting the even numbers!!! 

even = []
for x in fibonacci_seq:
    if x % 2 == 0:
        even.append(x)

print (even)

#Sum of the even numbers!

SumFibo = sum(even)
print(SumFibo)









    



[0, 2, 8, 34, 144, 610, 2584, 10946, 46368, 196418, 832040, 3524578]
4613732



In [ ]:

    
# This cell will be used for grading, leave it at the end of the notebook.