# Convergence of a recursive sequence $u_n$

This is my question. Let the sequence $u_n$ be recursively defined by $u_{n+1} = \frac{k}{1+u_n}$ where k>0 and $u_1$>0. Check the convergence of the sequence.

So I used this method.

Since $u_1$>0 and k>0 for all n $\epsilon$ $Z_+$,$u_n$>0

$$\lim_{n\to \infty} u_{n+1} = \frac{k}{1 + \lim_{n\to \infty} u_n}$$ Suppose $\lim_{n\to \infty} u_n$ exist and $\lim_{n\to \infty} u_n = t$ then $\lim_{n\to \infty} u_{n+1} = t$

$$t = \frac{k}{1+t}$$ $$t^2 + t - k = 0$$ $$t = \frac{-1\pm\sqrt{1+4k}}{2}$$ Since $u_1$>0 and k>0 for all n $\epsilon$ $Z_+$,$u_n$>0

$$\lim_{n\to \infty} u_n = \frac{\sqrt{1+4k}-1}{2}$$ Therefore the sequence is convergent

I'm not really sure this is the write way to do this. Please help me. If there is a better way please mention it.

• To prove that a sequence is convergent you cannot start assuming that it is convergent. – Kabo Murphy Jun 6 '18 at 10:27
• So what would be the best way to approach this question then – K.H.P.Kariyawasam Jun 6 '18 at 11:07
• Your argument needs two parts. One part, which you did, shows if it is convergent, then the limit is what you computed. The other part needs to show that it converges. – GEdgar Jun 6 '18 at 12:41

\begin{align*} u_{n} = \frac{k}{1+u_{n-1}} = \frac{k}{1+\frac{k}{1+u_{n-2}}} = \frac{(1+u_{n-2}) \cdot k}{1+u_{n-2} + k} < \frac{(1+u_{n-2}) \cdot k}{1+u_{n-2}} = k. \end{align*} Also, it is oscillating in the sense that $u_n < u_{n+1} \Leftrightarrow u_{n+1} > u_{n+2}$: If, for instance, $u_{n} < u_{n+1}$, then \begin{align*} u_{n+2} = \frac{k}{1+u_{n+1}} < \frac{k}{1+u_n} = u_{n+1}, \end{align*} and vice versa. Using this oscillating property, one can prove that $|u_{n+1} - u_n | < |u_{n}- u_{n-1}|$ for all $n$, and with some estimates of the size of $|u_{n+1}-u_n|$ one can then hope to prove that