Oh well, it was probably too long of a post for such an uninteresting 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, ...Find the sum of all the even-valued terms in the sequence which do not exceed four million.

if __name__ == '__main__': sum = 0 cur = 1 prev = 0 while cur + prev <= 4000000: newPrev = cur cur = cur + prev prev = newPrev if (cur % 2 == 0): sum = sum + cur print sum