Let { u n } be a sequence satisfying the recurrence relation u 1 = 1 , u 2 = 2 and u n = u n − 1 + u n − 2 for n ≥ 3 .
Prove that n → ∞ lim u n u n + 1 exists. Calculate this limit.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Can you show ts proof?
We can deduce that u(n+1)* u(n+1)/ u(n) * u(n) - u(n)( u (n) + u (n+1)/ u(n)* u(n)= (-1) pow (n+1) / u(n) * u(n).
The succesive values for u(n) are: 1,2,3,5,8,13,...,u(n) -> infinte with n.
( u (n+1)/u(n) ) pow 2 - (u (n+1) / u(n)) -1= (-1) pow (n+1) / u (n) pow 2.
We say that when n-> infinte X= lim (u (n+1)/ u (n) )
X
X - X -1=0 => X= ( 1 + sqrt5)/2=1,618033989...,
for a=1 we got b
b -b -1=0 => b=X.
It's hardly understandable without Latex :(
I will rewrite it on a piece of paper and post it! :D
Problem Loading...
Note Loading...
Set Loading...
The recurrence relation is clearly just the Fibonacci sequence. It is well known that the ratio of consecutive Fibonacci terms tends towards the Golden Ratio which is equal to 2 1 + 5