Alternating Series

Author: John J Weber III, PhD Corresponding Textbook Sections:

Expected Educational Results

Bloom’s Taxonomy

A modern version of Bloom’s Taxonomy is included here to recognize various different levels of understanding and to encourage you to work towards higher-order understanding (those at the top of the pyramid). All Objectives, Investigations, Activities, etc. are color-coded with the level of understanding.

Bloom’s Taxonomy for different levels of understanding
Figure 1.1: Bloom's Taxonomy

Alternating Series

Definition: Alternating Series

An Alternating Series is a series whose terms are alternatively positive and negative, i.e., n=0[(1)nan] or n=0[(1)n+1an]

Theorem: Alternating Series Estimation Theorem

Let S be the total sum of the convergent Alternating Series, n=0(1)nan. Let Sn be the the partial sum of the first n terms. Let Rn be the remainder that is defined as the difference between S and Sn. Then the absolute error is |Rn||SSn||an+1|.

Example 01:

  1. Find the partial sum (to six (6) decimal places), S11 for n=1(1)n+11n3.

  2. Find the maximum error of S11.

Solution:

  1. S10=10.125+0.0370370.015625+0.0080.004630 +0.0029150.001953+0.0013720.001+0.000751=0.901868

  2. The maximum error by the Alternating Series Estimation Theorem is |Rn||a11+1|=|a12|=|0.000578|=0.000578

Investigation 02

Find S6, to six (6) decimal places. Find the maximum error of S6.

  1. n=1(1)n+11n

  2. n=1(1)n1n2

  3. n=1(1)nln(n)n2

  4. n=0(1)n+1n2en

Example 02:

Find the number of terms of n=1(1)n+11n3 are needed in the partial sum, Sn, so that the maximum error is |Rn|=0.0001.

Solution:

By the Alternating Series Estimation Theorem, |Rn||an+1|=|1(n+1)3|=0.0001

1(n+1)3=0.0001(n+1)3=10.0001=10000

n+1=100003=21.5443n=20.5443n=21

Note that n is rounded up.

Investigation 03

Find the number of terms of each of the following series that are needed in the partial sum, Sn, so that the maximum error is |Rn|=0.0001.

  1. n=1(1)n+11n

  2. n=1(1)n1n2

  3. n=1(1)nln(n)n2

  4. n=0(1)n+1n2en

CC BY-NC-SA 4.0

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License [http://creativecommons.org/licenses/by-nc-sa/4.0/].

Created: Monday, 20 June 2022 - 21:25 (EDT)