Proving the Maximal Member in a Converging Sequence An > 0 to 0

  • Thread starter Thread starter transgalactic
  • Start date Start date
  • Tags Tags
    Max
transgalactic
Messages
1,386
Reaction score
0
An is a bounded sequence which converges to 0.
An>0 for every n.
prove that in this sequence we have a maximal member
??

again its obvious because if a sequence is descending and it converges from a positive number
to 0.
so 0 is the larger lower bound
and our first member must be the larger

how to transform it to math?
 
Physics news on Phys.org
If it converges to 0, then finitely many members of the sequence take on a different value (that number may be small or large but it is still finite) and the rest of the terms approach 0.
 
how to prove it mathematically?
 
By combining what you and I wrote and using proper notation
 
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