After the first few numbers in the Fib sequence, Fib(n) is very nearly equal to (phi)n / sqrt(5) where phi is the Golden Ratio = [1+sqrt(5)]/2
[The difference is around 0.00003 by Fib(20)]
So you want the smallest n such that (phi)n / sqrt(5) ≥ 10999
Taking logs,
n*log(phi) - 0.5*log(5) ≥ 999
n*log(phi) ≥ 999 + 0.5*log(5) = 999.349
n ≥ 999.349/log(phi) = 999.349/0.2090
So n = 4781
Chat with our AI personalities
If the Fibonacci sequence is denoted by F(n), where n is the first term in the sequence then the following equation obtains for n = 0.
Leonardo Fibonacci first recorded his sequence in his book Liber Abaci, which was published in 1202.
10946
1, 1 and 2
0,1,1,2,3,5,8,13