## Definition 3.5.1: Power Sequence

**Power Sequence**: The convergence properties of the power sequence depends on the size of the base

*a*:

*|a| < 1*: the sequence converges to 0.*a = 1*: the sequence converges to 1 (being constant)*a > 1*: the series diverges to plus infinity*a -1*: the series diverges

**Convergent Power series with**

*a = -9/10*

**Divergent Power series with a = 11/10**

### Proof:

This seems an obvious statement: if a number is in absolute values less than one, it gets smaller and smaller when raised to higher and higher powers. Proving something 'obvious', however, is often difficult, because it may not be clear how to start. To prove the statement we have to resort to one of the elementary properties of the real number system: the Archimedian principle.**Case***a > 1*:- Take any real number
*K > 0*and define

Since*x = a - 1**a > 1*we know that*x > 0*. By the Archimedian principle there exists a positive integer*n*such that*nx > K - 1*. Using Bernoulli's inequality for that*n*we have:

But since*a*^{n}= (1 + x)^{n}1 + nx > 1 + (K - 1) = K*K*was an arbitrary number, this proves that the sequence*{a*is unbounded. Hence it can not converge.^{n}} **Case***0 < a < 1*:- Take any
*> 0*. Since*0 < a < 1*we know that*1/a > 1*, so that by the previous proof we can find an*N*with

But then it follows that*a*for all^{n}<*n > N**{a*converges to zero.^{n}} **Case***-1 < a < 0*:- By the above proof we know that
*| a*converges to zero. But since^{n}|*-| a*the sequence {^{n}| < a^{n}< | a^{n}|*a*} again converges to zero by the Pinching Theorem.^{n} **Case***a < -1*:- Extract the subsequence
*{a*from the sequence^{2m}}*{a*. Then this sequence diverges to infinity by the first part of the proof, and therefore the original sequence can not converge either.^{n}} **Case***a = 1*:- This is the constant sequence, so it converges.
**Case***a = -1*:- We have already proved that the sequence does not converge.