Let p>0 and suppose that the sequence {xn} is defined recursive as
x1=√p,xn+1=√p+xn,
for all n∈N.
How can I show that xn converges, and find its limit?
I can see that one upper bound is obviously 1+2√p. Can I use this fact somehow?
Answer
Plan. We are going to show that {xn}n∈N is an increasing and upper bounded sequence, which shall imply that {xn}n∈N converges. Next we shall find the limit using the recursion relation.
A. First, {xn}n∈N 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+2√p. Indeed x0=√p<1+2√p. Assume that xk<1+2√p. Then
xk+1=√p+xk<√p+1+2√p=1+√p<1+2√p.
But an increasing and upper bounded sequence converges.
C. Let xn→x. Clearly, x≥x0=√p>0.
Then xn+1=√xn+p→√p+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