def testFibonacci(self): while True: try: n = int(input()) print(util.fibonacci(n)) except: break
import utilities fib = utilities.fibonacci(1, 2, 4000000) even_fib = [] for i in range(0, len(fib)): if fib[i] % 2 == 0: even_fib.append(fib[i]) print(sum(even_fib))
""" Link: https://projecteuler.net/problem=2 Description: 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. """ from itertools import takewhile from utilities import fibonacci def is_less_than(cutoff): def inner(num): return num < cutoff return inner print sum(x for x in takewhile(is_less_than(4000000), fibonacci()) if not x % 2)
def sum_even_fibonacci_numbers(n): fibonacci(n) return sum([FIB_LOOKUP[x] for x in range(1, n+1) if FIB_LOOKUP[x] % 2 == 0])
from utilities import fibonacci for index, item in enumerate(fibonacci()): if len(str(item)) >= 1000: print index break