Problem 25

问题描述：

The Fibonacci sequence is defined by the recurrence relation:

F _n = F _n1 + F _n2, where F ₁ = 1 and F ₂ = 1.

Hence the first 12 terms will be:

F ₁ = 1
F ₂ = 1
F ₃ = 2
F ₄ = 3
F ₅ = 5
F ₆ = 8
F ₇ = 13
F ₈ = 21
F ₉ = 34
F ₁₀ = 55
F ₁₁ = 89
F ₁₂ = 144

The 12th term, F₁₂, is the first term to contain three digits.

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

解决问题：

找到Fibonacci 数列里第一个有1000位的数字。

大数运算吧。