Created
April 25, 2017 05:48
-
-
Save james-prado/bde2c37092df84cc05cf15e3209e2512 to your computer and use it in GitHub Desktop.
Project Euler Question 2
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# 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. | |
# Find the sum of the even-valued terms < four million in the Fibonacci sequence | |
class Fibonacci_numbers: | |
def __init__(self, min, max): | |
self.__num = min | |
formula = self.__num[len(self.__num) - 1] + self.__num[len(self.__num) - 2] | |
while (formula < max): | |
self.__num.append(formula) | |
formula = self.__num[len(self.__num) - 1] + self.__num[len(self.__num) - 2] | |
def num(self): | |
return self.__num | |
print(sum([x for x in Fibonacci_numbers([1,2], 4000000).num() if x % 2 == 0])) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment