Saturday, August 13, 2016

calculus - Convergence and limit of a recursive sequence xn+1=sqrtp+xn




Let p>0 and suppose that the sequence {xn} is defined recursive as
x1=p,xn+1=p+xn,


for all nN.



How can I show that xn converges, and find its limit?




I can see that one upper bound is obviously 1+2p. Can I use this fact somehow?


Answer



Plan. We are going to show that {xn}nN is an increasing and upper bounded sequence, which shall imply that {xn}nN converges. Next we shall find the limit using the recursion relation.



A. First, {xn}nN is an increasing sequence. This can be shown inductively:



For k=1: x1=p+x0>p=x0.



If $x_{k-1}


B. Next, we observe that {xn} is upper bounded by 1+2p. Indeed x0=p<1+2p. Assume that xk<1+2p. Then
xk+1=p+xk<p+1+2p=1+p<1+2p.



But an increasing and upper bounded sequence converges.



C. Let xnx. Clearly, xx0=p>0.




Then xn+1=xn+pp+x.



But limxn+1=x, and hence
x=p+x


or
x2=x+p,


or
x=1±1+4p2.

We choose the one with the plus sign since the other one is negative.



Hence
x=1+1+4p2.



No comments:

Post a Comment

analysis - Injection, making bijection

I have injection f:AB and I want to get bijection. Can I just resting codomain to f(A)? I know that every function i...