Thread: fibonnaci - inequality

If F(0) = 0 , F(1)= 1....

Solve for n

F(n-1)< googol <F(n)

Originally Posted by austinvishal

If F(0) = 0 , F(1)= 1....

Solve for n

F(n-1)< googol <F(n)

Use Binet's formula for the -th Fibonacci number:



where is the Golden number

As will be very large will be negligible so you need to find such that:



CB

but googol being 10^100 the n might be generalised solution

Originally Posted by austinvishal

but googol being 10^100 the n might be generalised solution

What does that mean?

CB

is this solution right
480.19<n<481.19

can you explain me the steps? i made a calculation error i suppose

I agree with austinvishal on this one. Taking logs to base 10 (as we old-timers used to do all the time before they came up with these newfangled electronic thingies), we want to find . So we should take n = 481.

Originally Posted by Opalg

I agree with austinvishal on this one. Taking logs to base 10 (as we old-timers used to do all the time before they came up with these newfangled electronic thingies), we want to find . So we should take n = 481.

Yes, arithmetic error.

CB