Skip to main content
Mathematics LibreTexts

Alternating Series

  • Page ID
    219483
  • \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

    \( \newcommand{\dsum}{\displaystyle\sum\limits} \)

    \( \newcommand{\dint}{\displaystyle\int\limits} \)

    \( \newcommand{\dlim}{\displaystyle\lim\limits} \)

    \( \newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\)

    ( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\)

    \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)

    \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\)

    \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)

    \( \newcommand{\Span}{\mathrm{span}}\)

    \( \newcommand{\id}{\mathrm{id}}\)

    \( \newcommand{\Span}{\mathrm{span}}\)

    \( \newcommand{\kernel}{\mathrm{null}\,}\)

    \( \newcommand{\range}{\mathrm{range}\,}\)

    \( \newcommand{\RealPart}{\mathrm{Re}}\)

    \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)

    \( \newcommand{\Argument}{\mathrm{Arg}}\)

    \( \newcommand{\norm}[1]{\| #1 \|}\)

    \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)

    \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\AA}{\unicode[.8,0]{x212B}}\)

    \( \newcommand{\vectorA}[1]{\vec{#1}}      % arrow\)

    \( \newcommand{\vectorAt}[1]{\vec{\text{#1}}}      % arrow\)

    \( \newcommand{\vectorB}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \( \newcommand{\vectorC}[1]{\textbf{#1}} \)

    \( \newcommand{\vectorD}[1]{\overrightarrow{#1}} \)

    \( \newcommand{\vectorDt}[1]{\overrightarrow{\text{#1}}} \)

    \( \newcommand{\vectE}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash{\mathbf {#1}}}} \)

    \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \(\newcommand{\longvect}{\overrightarrow}\)

    \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

    \(\newcommand{\avec}{\mathbf a}\) \(\newcommand{\bvec}{\mathbf b}\) \(\newcommand{\cvec}{\mathbf c}\) \(\newcommand{\dvec}{\mathbf d}\) \(\newcommand{\dtil}{\widetilde{\mathbf d}}\) \(\newcommand{\evec}{\mathbf e}\) \(\newcommand{\fvec}{\mathbf f}\) \(\newcommand{\nvec}{\mathbf n}\) \(\newcommand{\pvec}{\mathbf p}\) \(\newcommand{\qvec}{\mathbf q}\) \(\newcommand{\svec}{\mathbf s}\) \(\newcommand{\tvec}{\mathbf t}\) \(\newcommand{\uvec}{\mathbf u}\) \(\newcommand{\vvec}{\mathbf v}\) \(\newcommand{\wvec}{\mathbf w}\) \(\newcommand{\xvec}{\mathbf x}\) \(\newcommand{\yvec}{\mathbf y}\) \(\newcommand{\zvec}{\mathbf z}\) \(\newcommand{\rvec}{\mathbf r}\) \(\newcommand{\mvec}{\mathbf m}\) \(\newcommand{\zerovec}{\mathbf 0}\) \(\newcommand{\onevec}{\mathbf 1}\) \(\newcommand{\real}{\mathbb R}\) \(\newcommand{\twovec}[2]{\left[\begin{array}{r}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\ctwovec}[2]{\left[\begin{array}{c}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\threevec}[3]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\cthreevec}[3]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\fourvec}[4]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\cfourvec}[4]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\fivevec}[5]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\cfivevec}[5]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\mattwo}[4]{\left[\begin{array}{rr}#1 \amp #2 \\ #3 \amp #4 \\ \end{array}\right]}\) \(\newcommand{\laspan}[1]{\text{Span}\{#1\}}\) \(\newcommand{\bcal}{\cal B}\) \(\newcommand{\ccal}{\cal C}\) \(\newcommand{\scal}{\cal S}\) \(\newcommand{\wcal}{\cal W}\) \(\newcommand{\ecal}{\cal E}\) \(\newcommand{\coords}[2]{\left\{#1\right\}_{#2}}\) \(\newcommand{\gray}[1]{\color{gray}{#1}}\) \(\newcommand{\lgray}[1]{\color{lightgray}{#1}}\) \(\newcommand{\rank}{\operatorname{rank}}\) \(\newcommand{\row}{\text{Row}}\) \(\newcommand{\col}{\text{Col}}\) \(\renewcommand{\row}{\text{Row}}\) \(\newcommand{\nul}{\text{Nul}}\) \(\newcommand{\var}{\text{Var}}\) \(\newcommand{\corr}{\text{corr}}\) \(\newcommand{\len}[1]{\left|#1\right|}\) \(\newcommand{\bbar}{\overline{\bvec}}\) \(\newcommand{\bhat}{\widehat{\bvec}}\) \(\newcommand{\bperp}{\bvec^\perp}\) \(\newcommand{\xhat}{\widehat{\xvec}}\) \(\newcommand{\vhat}{\widehat{\vvec}}\) \(\newcommand{\uhat}{\widehat{\uvec}}\) \(\newcommand{\what}{\widehat{\wvec}}\) \(\newcommand{\Sighat}{\widehat{\Sigma}}\) \(\newcommand{\lt}{<}\) \(\newcommand{\gt}{>}\) \(\newcommand{\amp}{&}\) \(\definecolor{fillinmathshade}{gray}{0.9}\)

    The Alternating Series Test

    Suppose that a weight from a spring is released.  Let a1 be the distance that the spring drops on the first bounce.  Let a2 be the amount the weight travels up the first time.  Let a3  be the amount the weight travels on the way down for the second trip. Let a4 be the amount that the weight travels on the way up for the second trip, etc.

            Picture of the line segments a1, a2, a3, a4, a5, a6, ...  The a1 bottom matches a2 bottom, a2 top matches a3 top, a3 bottom matches a4 bottom, a4 top matches a5 top, a5 bottom matches a6 bottom.


    Then  eventually the weight will come to rest somewhere in the middle. This leads us to


     

              Theorem: The Alternating Series Test   

    Let an  >  0 for all n and suppose that the following two conditions hold:

    1. { an } is a decreasing sequence for large n.

    2. \(  \lim\limits_{n\to \infty} a_n = 0   \)

    Then the corresponding series  \(  \displaystyle\sum_{n=1}^{\infty}(-1)^n a_n  \) and  \(\displaystyle\sum_{n=1}^{\infty}(-1)^{n+1} a_n  \) 

    converge.


    Proof:  

    We will prove the theorem for the second given series.  This is enough, since the first can be obtained from the second just by multiplying by -1.  We look at the series as adding two at a time and then adding them all together.

            s2n = (a1 - a2) + (a3 - a4) + ...+ (a2n-1 - a2n)  >  0

    which shows that this is bounded below by 0.  Now single out the first term and then add the rest two at a time

            s2n = a1 - (a2 - a3) - (a4 - a5) - ...- (a2n-2 - a2n-1) - a2n   
           

            = a1 - [(a2 - a3) + (a4 - a5) + ...+ (a2n-2 - a2n-1) + a2n]  

     

    This second equation subtracts a positive number from the first term.  Hence  

            s2n < a1  

    which shows that the sequence is bounded above by a1.  Notice that s2n is monotonic since each difference is positive.  Therefore s2n  is bounded and monotonic and thus converges.  Since the an tend toward zero as n tends towards infinity, we have

              

    The limit of the partial sums exist and hence the series converges.
     


    Example     

            \(  \displaystyle\sum_{n=1}^{\infty}\frac{(-1)^n}{n}   \)
    converges by the alternating series test, since the 

              \(  \lim\limits_{n\to \infty} \frac{1}{n} = 0   \)

    and 

               1                1
                        >                   
               n              n + 1

    Exercises:   

    Determine whether the following converge:

    1. \(  \displaystyle\sum_{n=1}^{\infty}\frac{(-1)^{n+1}}{n!}   \)

    2. \(  \displaystyle\sum_{n=1}^{\infty}\frac{(-1)^n n^2}{n+1}   \)


    The Remainder Theorem


    Consider the spring example again.  The weight will always be between the two previous positions.  Hence we have


     

          The Remainder Theorem

    Let 

              \(  \displaystyle\sum_{n=1}^{\infty}(-1)^n a_n   \)

    then


              |L - sn|  <  an + 1   

     

     

    This says that the error in using n terms to approximate an alternating series is always less then the n + 1st term.


    Example

    Use a calculator to determine

            \(  \displaystyle\sum_{n=1}^{\infty}\frac{(-1)^{n+1}}{n}   \)

    With an error of less than .01.

    Solution:

    We have 

             Error < .01 

    so choose n such that 

                 1
                       <  .01     
                n


    Here, n  =  101 will work.  Then use your calculator to get  0.70.
     


    Absolute and Conditional Convergence



     

                                     Definitions

    1.  \(  \displaystyle\sum_{n=1}^{\infty}(-1)^{n}a_n   \) is called absolutely convergent if \(  \displaystyle\sum_{n=1}^{\infty}a_n   \) converges.

    2.  \(  \displaystyle\sum_{n=1}^{\infty}(-1)^{n}a_n   \)  is called conditionally convergent if \(  \displaystyle\sum_{n=1}^{\infty}(-1)^{n}a_n   \)
        converges, but  \(  \displaystyle\sum_{n=1}^{\infty}a_n   \) diverges.


    Example:   

    The alternating harmonic series  is conditionally convergent 

            \(  \displaystyle\sum_{n=1}^{\infty}\frac{(-1)^{n}}{n}   \)

    since we saw before that it converges by the alternating series test but its absolute value (the harmonic series) diverges.  

    The series 

              \(  \displaystyle\sum_{n=1}^{\infty}\frac{(-1)^{n}}{n^2}   \)

    is absolutely convergent since the series of the absolute value of its terms is a P-series with p  =  2, hence converges.


    The Rearrangement Theorem


     

                The Rearrangement Theorem

    Let \(  \displaystyle\sum_{n=1}^{\infty}(-1)^n a_n   \) be a conditionally convergent series and let k be a real number.  Then there exists a rearrangement of the terms so that you add them up and end up with k. As strange as it may seem, addition is not commutative for conditionally convergent series.  On the other hand for absolutely convergent series any rearrangement produces the same limit.

     

     



    Back to the Sequences and Series Page


    Alternating Series is shared under a not declared license and was authored, remixed, and/or curated by LibreTexts.

    • Was this article helpful?