python.p0002 Namespace Reference

Functions
def	fib ()
def	fib_by_3
def	main ()

Detailed Description

Project Euler Problem 2

I also decided that I like lazy functions on this one. Also seen: generator
comprehensions

Revision 1:

I split fib() up so that there is one version which limits and another which
does not.

Revision 2:

Utilize the underlying pattern of the sequence to avoid needing modulo division,
speeding up by ~2x.

Revision 3:

Revise fib() to be consistent with fib_by_3(). Now both iterate starting from 0.

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.

Function Documentation

def python.p0002.fib	(		Iterator,
			int
	)

This generator goes through the fibonacci sequence

Here is the caller graph for this function:

def python.p0002.fib_by_3

(

start_index

)

Here is the call graph for this function:

Here is the caller graph for this function:

def python.p0002.main

(

int

)

Here is the call graph for this function: