Proof of convergence and divergence

courtrigrad
Messages
1,236
Reaction score
2
Prove that if a_{n} > 0 and \sum a_{n} converges, then \sum a_{n}^{2} also converges.

So if \sum a_{n} converges, this means that \lim_{n\rightarrow \infty} a_{n} = 0. Ok, so from this part how do I get to this step: there exists an N such that | a_{n} - 0 | < 1 for all n > N \rightarrow 0\leq a_{n} < 1. Thus 0\leq a_{n}^{2} \leq a_{n}. How did we choose |a_{n} - 0| < 1?
 
Physics news on Phys.org
nvm got it. just arbritrary number.
 
Are you sure you got it? There's not much in your first post that looks right, and "just arbitrary number" doesn't seem to make any sense, or have much at all to do with proving the desired claim.
 
It loox fine to me.
\sum a_{n} converges ==> \lim_{n\rightarrow \infty} a_{n} = 0 ==> there exists an N
such that for all n > N \rightarrow 0\leq a_{n} < 1
 
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...

Similar threads

Back
Top