Proving Convergence and Finding Limit of Recursive Sequence

[Caeder]

Given the following sequence:

x_0 = 1, \quad x_1 = \sqrt{3+1}, \quad x_2 = \sqrt{3+\sqrt{4}}, \quad x_3 = \sqrt{3+\sqrt{5}},
x_4 = \sqrt{3+\sqrt{3+\sqrt{5}}}, \quad x_5 = \sqrt{3+\sqrt{3+\sqrt{3+\sqrt{5}}}} \ldots

prove the above sequence converges and determine the limit.

......

So from n=3 onwards, I notice that the sequence is recursively defined:

n \geq 4,\;x_n = \sqrt {3 + x_{n - 1} }

To prove convergence, I'd stimply have to show sequence is bounded above and that it's increasing.

I'm not quite sure how to do this with a recursive function.

To find the limit, I realized that

x_n = \sqrt {3 + x_{n - 1} } is at it's "equilibrium point" when x = 3 + \sqrt{x}. I solved for \sqrt{x} and found the limit to be:

\frac{1\pm\sqrt{13}}{2}. I then see that we go towards:

\frac{1+\sqrt{13}}{2}

So I know the limit will be the above if the sequence converges.

Any help on the proof?

 

[al-mahed]

what you call "equilibrium point"?

 

[Caeder]

what you call "equilibrium point"?

Stable point..

 

[SiddharthM]

i'm not sure what a stable or equilibrium point is. You can show the sequence is bounded and monotonic using induction, show that it's bounded first, this will help you show it's monotonic.

This means lim x_{n-1} = lim x_n exists. The recursive definition and limit laws show that the limit, call it, x must satisfy the equation:

x=squareroot(3+x) or the quadratic
x^2-x-3, solve and deduce which solution is x.

 

[Caeder]

i'm not sure what a stable or equilibrium point is. You can show the sequence is bounded and monotonic using induction, show that it's bounded first, this will help you show it's monotonic.

This means lim x_{n-1} = lim x_n exists. The recursive definition and limit laws show that the limit, call it, x must satisfy the equation:

x=squareroot(3+x) or the quadratic
x^2-x-3, solve and deduce which solution is x.

I already know the limit. I'm having a hard time with the proof.

 

[SiddharthM]

I already know the limit. I'm having a hard time with the proof.

I gave you the outline of a rigorous proof.

 

[Caeder]

\begin{array}{l}<br /> x_2 &lt; x_3 &lt; 9 \\ <br /> \sqrt {x_2 } &lt; \sqrt {x_3 } &lt; 3 \\ <br /> 3 + \sqrt {x_2 } &lt; 3 + \sqrt {x_3 } &lt; 6 \\ <br /> \underbrace {\sqrt {3 + \sqrt {x_2 } } }_{x_3 } &lt; \underbrace {\sqrt {3 + \sqrt {x_3 } } }_{x_4 } &lt; \sqrt 6 \\ <br /> x_3 &lt; x_4 &lt; 9 \\ <br /> \end{array}

Now I show it from the k+1 term? Not exactly sure how. But does that look right?

 

[SiddharthM]

show x_3 is less than 3, then assume x_n is less than 3. what can you say then?

x_{n+1}=root(3+x_n)<root(3+3)<root(3+6)=3

done, so know x_n is bounded, now show it is monotonic.

 

[al-mahed]

x_n is positive for all n = {0,1,2,3,...}

x_{n + 1} = \sqrt {3 + x_n} ==> x_{n + 1} &gt; x_n for all n