Question

The Fibonacci sequence is defined by the recurrence relation:
Fn = F(n-1)+F(n-2) where F1 = 1 and F2 = 1.
Hence the first 12 terms will be:
F1 = 1
F2 = 1
F3 = 2
F4 = 3
F5 = 5
F6 = 8
F7 = 13
F8 = 21
F9 = 34
F10 = 55
F11 = 89
F12 = 144
The 12th term, F12, is the first term to contain three digits.
What is the first term in the Fibonacci sequence to contain 1000 digits?

Answer 1

that doesnt depend on what the number is given i hope.....

Answer 2

We need to find the value of n such that the corresponding fibonacci number has 1000 digits. Now Does it depend on n or not. And please give examples to prove your point.

Answer 3

don't post projecteuler problems here.. it's just lame :P

Answer 4

So Sorry. It was given in my assignment thats why i asked here. Thnx for letting me know.

Answer 5

@raun no worries.. i thought you just pasted the problem from projecteuler :P it doesn't sound so difficult but it just needs a lot of coding and i find it a bit tedious :P

Answer 6

i can say one thing, but dont be serious... I hope you know the coding... try it in trial and error method ;) combine the codes of fibonacci and digit partition, and together by giving finite inputs i hope we can get the result for that!!!