Even Fibonacci numbers

-

Problem:

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.



Solution:

x = 1
y = 1
z = 0
sum = 0

while z < 4000000:
   z = (x+y)         
   if z%2 == 0:
       sum = sum + z

   x = y
   y = z

print(sum)

Note: This problem was taken from Project Euler (www.projecteuler.net).

Comments

Post a Comment

Popular posts from this blog

Largest palindrome product

-
Problem:  A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99. Find the largest palindrome made from the product of two 3-digit numbers. Solution: list = [] for i in range ( 100 , 999 ): for j in range ( 100 , 999 ): num = i * j if str (num) == str (num)[:: - 1 ]: list . append(num) print ( max ( list )) Note: This problem was taken from Project Euler (www.projecteuler.net).
Read more