Absolute Convergence Test and Properties

If ∑|an| converges, then ∑an it is said that it converges absolutely. If ∑|an| diverges but ∑an still converges, then ∑an is said to it converges conditionally.

Rearrangements

Definition:

Let f:N→N, where f is bijective, bn=af(n) then, ∑bn is a rearrangements of ∑an

Theorem: If the series ∑an is absolutely convergent, then any rearrangements of this series will converge to the same limit.

Riemann Rearrangement Theorem

Let ∑n=1∞an an be a conditionally convergent series.

  1. For every x∈R― there exists a rearrangement σ such that:

    ∑n=1∞aσ(n)=x
  2. There’s a rearrangement σ such that ∑n=1∞aσ(n) doesn’t converge in R―.

Limit Comparison V.2

Let the sequences (an) , and (bn) be non-zero, and that the following limit exists:

r=limn→∞|anbn|

Ratio and Root Test

Let the sequence (an), given the following limits:

limn→∞|an+1an|=limn→∞|an|1/n=r

Raabe’s Test

If the Ratio and Root Test are inclusive, then by checking the following limit, it can help:

r′=limn→∞(n(1−|an+1an|))