# Euler Problem 25¶

The Fibonacci sequence is defined by the recurrence relation:

$F_n = F_{n−1} + F_{n−2}$, where $F_1 = 1$ and $F_2 = 1$. Hence the first 12 terms will be:

    F1 = 1
    F2 = 1
    F3 = 2
    F4 = 3
    F5 = 5
    F6 = 8
    F7 = 13
    F8 = 21
    F9 = 34
    F10 = 55
    F11 = 89
    F12 = 144

The 12th term, $F_{12}$, is the first term to contain three digits.

What is the index of the first term in the Fibonacci sequence to contain 1000 digits?

Reuse fibonacci generator and then straight forward.

In [4]:

    def fibonacci_generator():
        a = 0
        b = 1
        yield 1
        while True:
            yield a + b
            a, b = b, (a + b)

    for i, f in enumerate(fibonacci_generator()):
        if len(str(f)) >= 1000:
            break

    s = i + 1
    assert(s == 4782)
    print(s)

    4782