mit/fib_yield.py


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33

#!/usr/bin/python3

def genFib():
    """ Fibonacci sequence based on generators """
    fibn_1 = 1 #fib (n-1)
    fibn_2 = 0 #fib (n-2)

    while True:
        # fib(n) = fib(n - 1) + fib(n - 2)
        next = fibn_1 + fibn_2
        yield next
        fibn_2 = fibn_1
        fibn_1 = next

def genPrimes():

    prime = 2

    while True:

        is_prime = True

        for n in range(2, prime):
            if (prime % n) == 0 and n != prime:
                prime += 1
                is_prime = False
                break

        if is_prime:
            yield prime
            prime += 1
        else:
            continue