Problem #3
Recall that the Fibonacci numbers are defined recursively by
F1 = 1, F2 = 1, and
Fn+1 =
Fn + Fn-1
for n ≥ 2.
What is the smallest (positive) integer n
such that the decimal representation of
Fn ends in four zeroes?
Source: The Bernoulli Trials