answersLogoWhite

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

User Avatar

Wiki User

12y ago

Still curious? Ask our experts.

Chat with our AI personalities

BlakeBlake
As your older brother, I've been where you are—maybe not exactly, but close enough.
Chat with Blake
DevinDevin
I've poured enough drinks to know that people don't always want advice—they just want to talk.
Chat with Devin
ViviVivi
Your ride-or-die bestie who's seen you through every high and low.
Chat with Vivi

Add your answer:

Earn +20 pts
Q: What is the first term in the Fibonacci sequence to contain 1000 digits?
Write your answer...
Submit
Still have questions?
magnify glass
imp