$\newenvironment {prompt}{}{} \newcommand {\ungraded }{} \newcommand {\todo }{} \newcommand {\oiint }{{\large \bigcirc }\kern -1.56em\iint } \newcommand {\mooculus }{\textsf {\textbf {MOOC}\textnormal {\textsf {ULUS}}}} \newcommand {\npnoround }{\nprounddigits {-1}} \newcommand {\npnoroundexp }{\nproundexpdigits {-1}} \newcommand {\npunitcommand }{\ensuremath {\mathrm {#1}}} \newcommand {\RR }{\mathbb R} \newcommand {\R }{\mathbb R} \newcommand {\N }{\mathbb N} \newcommand {\Z }{\mathbb Z} \newcommand {\sagemath }{\textsf {SageMath}} \newcommand {\d }{\mathop {}\!d} \newcommand {\l }{\ell } \newcommand {\ddx }{\frac {d}{\d x}} \newcommand {\zeroOverZero }{\ensuremath {\boldsymbol {\tfrac {0}{0}}}} \newcommand {\inftyOverInfty }{\ensuremath {\boldsymbol {\tfrac {\infty }{\infty }}}} \newcommand {\zeroOverInfty }{\ensuremath {\boldsymbol {\tfrac {0}{\infty }}}} \newcommand {\zeroTimesInfty }{\ensuremath {\small \boldsymbol {0\cdot \infty }}} \newcommand {\inftyMinusInfty }{\ensuremath {\small \boldsymbol {\infty -\infty }}} \newcommand {\oneToInfty }{\ensuremath {\boldsymbol {1^\infty }}} \newcommand {\zeroToZero }{\ensuremath {\boldsymbol {0^0}}} \newcommand {\inftyToZero }{\ensuremath {\boldsymbol {\infty ^0}}} \newcommand {\numOverZero }{\ensuremath {\boldsymbol {\tfrac {\#}{0}}}} \newcommand {\dfn }{\textbf } \newcommand {\unit }{\mathop {}\!\mathrm } \newcommand {\eval }{\bigg [ #1 \bigg ]} \newcommand {\seq }{\left ( #1 \right )} \newcommand {\epsilon }{\varepsilon } \newcommand {\phi }{\varphi } \newcommand {\iff }{\Leftrightarrow } \DeclareMathOperator {\arccot }{arccot} \DeclareMathOperator {\arcsec }{arcsec} \DeclareMathOperator {\arccsc }{arccsc} \DeclareMathOperator {\si }{Si} \DeclareMathOperator {\scal }{scal} \DeclareMathOperator {\sign }{sign} \newcommand {\arrowvec }{{\overset {\rightharpoonup }{#1}}} \newcommand {\vec }{{\overset {\boldsymbol {\rightharpoonup }}{\mathbf {#1}}}\hspace {0in}} \newcommand {\point }{\left (#1\right )} \newcommand {\pt }{\mathbf {#1}} \newcommand {\Lim }{\lim _{\point {#1} \to \point {#2}}} \DeclareMathOperator {\proj }{\mathbf {proj}} \newcommand {\veci }{{\boldsymbol {\hat {\imath }}}} \newcommand {\vecj }{{\boldsymbol {\hat {\jmath }}}} \newcommand {\veck }{{\boldsymbol {\hat {k}}}} \newcommand {\vecl }{\vec {\boldsymbol {\l }}} \newcommand {\uvec }{\mathbf {\hat {#1}}} \newcommand {\utan }{\mathbf {\hat {t}}} \newcommand {\unormal }{\mathbf {\hat {n}}} \newcommand {\ubinormal }{\mathbf {\hat {b}}} \newcommand {\dotp }{\bullet } \newcommand {\cross }{\boldsymbol \times } \newcommand {\grad }{\boldsymbol \nabla } \newcommand {\divergence }{\grad \dotp } \newcommand {\curl }{\grad \cross } \newcommand {\lto }{\mathop {\longrightarrow \,}\limits } \newcommand {\bar }{\overline } \newcommand {\surfaceColor }{violet} \newcommand {\surfaceColorTwo }{redyellow} \newcommand {\sliceColor }{greenyellow} \newcommand {\vector }{\left \langle #1\right \rangle } \newcommand {\sectionOutcomes }{} \newcommand {\HyperFirstAtBeginDocument }{\AtBeginDocument }$

A series is an infinite sum of the terms of sequence.

In the previous sections, we’ve seen several examples of sequence. If we have a sequence $\{a_n\}_{n=1}$, and represent it as an ordered list below:

• Do the numbers in the list approach a finite value?
• Can I sum all of the numbers in the list and obtain a finite result?

The first question is really whether the limit $\lim _{n \to \infty } a_n$ exists and we studied several ways to determine this previously. As it turns out, the second question is closely related to the first one. We motivate this through an example.

### Infinite series

The above scenario can be modeled using sequences. We have $\{A_n\}_{n=1}$ whose $n$-th term is given by the explicit formula $A_n=\left (\frac {1}{2}\right )^n$, and we represent the sequence by the ordered list below.

and we can interpret the series as the attempt to add up all of the terms in the above sequence. In order to determine if this can be done, we found a new sequence $\{S_n\}_{n=1}$ that was created from the original sequence. It is represented by the list below.

Note that the limit of this new sequence is exactly the sum of all of the terms in the old sequence! Let’s formalize the ideas in the last example with a definition.

The above definition really states that the symbols $\sum _{k=k_0}^{\infty } a_k$ and $\lim _{n \to \infty } s_n$ are exactly the same! It makes the content of the previous example more precise. This is quite important since we have techniques to determine whether limits of sequences exist. We are now able to recast the new question “Can I sum all of the terms in a sequence?” into the old question “Does the associated sequence of partial sums have a limit?”. To attack the latter, we can utilize all of our previous techniques for studying the limit of the sequence of partial sums.

Using our new terminology, what can we say about the series $\sum _{k=1}^\infty \left (\frac {1}{2}\right )^k$ from the previous example? The series convergesdiverges , and $\sum _{n=1}^\infty \left (\frac {1}{2}\right )^n = \answer [given]{1}$.

Now, let’s see an example.

### Properties of sums

We finish this section by giving some properties of series.

Notice, of course, that we’re working with convergent series in this theorem. Adding divergent series is trickier, but there is something we can say about the attempt to add a convergent series and a divergent series.

To understand why this theorem holds, note that if $\sum _{k=k_0}^\infty \big (a_k+b_k\big )$ would converge, by the last theorem, we would know that the difference

converges since both series above are convergent. Furthermore, the previous theorem also guarantees that

but this is precisely $\sum _{k=k_0}^{\infty } b_k$, which diverges by assumption. This is a contradiction, so $\sum _{k=k_0}^\infty \big (a_k+b_k\big )$ must diverge.

Essentially, this theorem ensures that it does not matter where we start summing the terms of a sequence. Since we have infinitely many terms to try to add together, the sum of the first finitely many will not affect if this addition is possible.

We now finish the section with an example that ties many ideas together.