The golden question

Calculus Level 2

Let { u n } \{u_n\} be a sequence satisfying the recurrence relation u 1 = 1 u_1=1 , u 2 = 2 u_2=2 and u n = u n 1 + u n 2 u_n=u_{n-1} + u_{n-2} for n 3 n \ge 3 .

Prove that lim n u n + 1 u n \displaystyle \lim_{n\to\infty} \frac{u_{n+1}}{u_n} exists. Calculate this limit.

\infty 1 + 5 2 \frac {1+\sqrt5}2 0 1

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.

2 solutions

Conor Donovan
Nov 21, 2016

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 1 + 5 2 \frac{1+\sqrt{5}}{2}

Can you show ts proof?

Puneet Pinku - 4 years, 5 months ago
Irina Stanciu
Nov 19, 2016

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 :(

Peter van der Linden - 4 years, 6 months ago

I will rewrite it on a piece of paper and post it! :D

Irina Stanciu - 4 years, 6 months ago

Log in to reply

Umm...it's been years and u hvnt posted😅

Rahul Gautam - 3 years, 3 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...