Forgot password? New user? Sign up
Existing user? Log in
In the Fibonacci sequence, F0=1F_{0}=1F0=1, F1=1{F_1}=1F1=1, and for all N>1N>1N>1, FN=FN−1+FN−2F_N=F_{N-1}+F_{N-2}FN=FN−1+FN−2.
How many of the first 2014 Fibonacci terms end in 0?
Problem Loading...
Note Loading...
Set Loading...