Prove this recursively defined sequence goes to 0

  • Thread starter Thread starter Ryker
  • Start date Start date
  • Tags Tags
    Sequence
Ryker
Messages
1,080
Reaction score
2

Homework Statement


Show that 2^{n^{1001}} |a_{n} - a_{\infty}| \rightarrow 0 as n \rightarrow \infty.

Here, an is defined recursively by a_{1} = 1, a_{n+1} = \frac{1}{2}(a_{n}+\frac{x}{a_{n}}).

I already know that a_{\infty} = \sqrt{x}.

Homework Equations


We are given a hint to consider (y_{n}) = \frac{a_{n} - a_{\infty}}{a_{n} + a_{\infty}}.

The Attempt at a Solution


I considered the hint, and by defining the sequence in the hint to be (yn) I got that yn+1 = yn2. However, I don't know how to proceed and show that the above sequence goes to zero. I know a_{n} - a_{\infty} \rightarrow 0 by definition, but I don't see how that yn thing helps. Any thoughts?
 
Last edited:
Physics news on Phys.org
Anyone? :frown:
 
OK, one final bump, and then I give up. But from the lack of responses I see I'm not the only one really puzzled by this problem.

Basically, I need to find a way to show (an) as defined above converges faster than (2n)1001 diverges.
 
You haven't mentioned the domain of the functions in (a_n). It should probably not contain 0, as I think the quantity in question doesn't converge for x=0.

I haven't checked it, but I assume that y_{n+1}=y_n^2 is correct. This implies that y_{n}=y_1^{2^n}. Moreover, we can calculate that |y_1|&lt; 1 from the definition of (y_n) and the fact that x\neq 0. Now \begin{eqnarray}<br /> 2^{n^{1001}} |a_{n} - a_{\infty}| &amp;=&amp; 2^{n^{1001}} |a_{n} + a_{\infty}|||y_n| \nonumber \\<br /> &amp;\leq&amp; 2^{n^{1001}} |2\sqrt{x}||y_n| \nonumber \\<br /> &amp;=&amp; 2^{n^{1001}} |2\sqrt{x}||y_1^{2^n}| \nonumber \\<br /> &amp;=&amp; 2^{n^{1001}} |2\sqrt{x}||y_1|^{2^n}<br /> \end{eqnarray}.
Can you carry on from here to prove that this must converge to 0 pointwise? And if you can, is the convergence uniform?
 
Hi Mr. Miyagi, and thanks for the response! Even though the homework due date has now already past, I appreciate the input. And in fact, after four hours of wracking my brain on how to do this, I did indeed finally come to the same conclusion as you did, and essentially used the fact that exponentials rise faster than polynomials. I feel really stupid for needing such a long time to figure that out, but eh...

Oh, and the domain is the real numbers, but x must be greater than zero.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top