0
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
Still curious? Ask our experts.
Chat with our AI personalities
Maxine
Judy
ViviAdd your answer:
Earn +20 pts
What is a squence of 112358132124?
The sequence 112358132124 is a variation of the Fibonacci sequence, where each number is the sum of the two preceding ones. It starts with 1, 1, 2, 3, 5, 8, 13, 21, and 34. In this case, the sequence is presented as a concatenated string of its first 12 Fibonacci numbers. Thus, it represents the digits of the Fibonacci numbers lined up together.
Explain how to find the terms of Fibonacci sequence?
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.
When did Leonardo Fibonacci discovered the Fibonacci numbers?
Leonardo Fibonacci first recorded his sequence in his book Liber Abaci, which was published in 1202.
What is the first five digit number in the Fibonacci sequence?
10946
What are the first 3 numbers of the Fibonacci numbers sequence?
1, 1 and 2
