# 8.1: Sequences

- Page ID
- 4199

We commonly refer to a set of events that occur one after the other as a *sequence* of events. In mathematics, we use the word *sequence* to refer to an ordered set of numbers, i.e., a set of numbers that "occur one after the other.''

For instance, the numbers 2, 4, 6, 8, ..., form a sequence. The order is important; the first number is 2, the second is 4, etc. It seems natural to seek a formula that describes a given sequence, and often this can be done. For instance, the sequence above could be described by the function \(a(n) = 2n\), for the values of \(n = 1, 2, \ldots\) To find the 10\(^\text{th}\) term in the sequence, we would compute \(a(10)\). This leads us to the following, formal definition of a sequence.

Definition 27: sequences, range and terms

- A
**sequence**is a function \(a(n)\) whose domain is \(\mathbb{N}\). - The
**range**of a sequence is the set of all distinct values of \(a(n)\). - The
**terms**of a sequence are the values \(a(1)\), \(a(2)\), ..., which are usually denoted with subscripts as \(a_1\), \(a_2\), ....

A sequence \(a(n)\) is often denoted as \(\{a_n\}\).

**Notation**: We use \(\mathbb{N}\) to describe the set of natural numbers, that is, the integers 1, 2, 3, ...

Definition: factorial

The expression \(3!\) refers to the number \(3\cdot2\cdot1 = 6\). In general,

\[n! = n\cdot (n-1)\cdot(n-2)\cdots 2\cdot1\]

where \(n\) is a natural number. We define \(0! = 1\). While this does not immediately make sense, it makes many mathematical formulas work properly.

Example \(\PageIndex{1}\): Listing terms of a sequence

List the first four terms of the following sequences.

- \(\{a_n\} = \left\{\frac{3^n}{n!}\right\}\)
- \(\{a_n\} = \{4+(-1)^n\}\)
- \( \{a_n\} = \left\{\frac{(-1)^{n(n+1)/2}}{n^2}\right\}\)

**Solution**

- \(a_1=\frac{3^1}{1!} = 3;\qquad a_2= \frac{3^2}{2!} = \frac92;\qquad a_3 = \frac{3^3}{3!} = \frac92; \qquad a_4 = \frac{3^4}{4!} = \frac{27}8\)

We can plot the terms of a sequence with a scatter plot. The "\(x\)''-axis is used for the values of \(n\), and the values of the terms are plotted on the \(y\)-axis. To visualize this sequence, see Figure 8.1(a). - \(a_1= 4+(-1)^1 = 3;\qquad a_2 = 4+(-1)^2 = 5;\quad a_3=4+(-1)^3 = 3; \qquad a_4 = 4+(-1)^4 = 5\). Note that the range of this sequence is finite, consisting of only the values 3 and 5. This sequence is plotted in Figure 8.1(b).
- \(\begin{align} a_1&= \frac{(-1)^{1(2)/2}}{1^2} = -1; \qquad a_2 = \frac{(-1)^{2(3)/2}}{2^2} =-\frac14 \\ a_3 &= \frac{(-1)^{3(4)/2}}{3^2} = \frac19 \qquad a_4 = \frac{(-1)^{4(5)/2}}{4^2} = \frac1{16}; \\ a_5 &= \frac{(-1)^{5(6)/2}}{5^2}=-\frac1{25} \end{align}\).

We gave one extra term to begin to show the pattern of signs is "\(-\), \(-\), \(+\), \(+\), \(-\), \(-\), \(\ldots\), due to the fact that the exponent of \(-1\) is a special quadratic. This sequence is plotted in Figure 8.1(c).

Example \(\PageIndex{2}\): Determining a formula for a sequence

Find the \(n^\text{th}\) term of the following sequences, i.e., find a function that describes each of the given sequences.

- 2, 5, 8, 11, 14, \(\ldots\)
- 2, \(-5\), 10, \(-17\), 26, \(-37\), \(\ldots\)
- 1, 1, 2, 6, 24, 120, 720, \(\ldots\)
- \(\frac52\), \(\frac52\), \( \frac{15}8\), \( \frac54\), \( \frac{25}{32}\), \(\ldots\)

**Solution**

We should first note that there is never exactly one function that describes a finite set of numbers as a sequence. There are many sequences that start with 2, then 5, as our first example does. We are looking for a simple formula that describes the terms given, knowing there is possibly more than one answer.

- Note how each term is 3 more than the previous one. This implies a linear function would be appropriate: \(a(n) = a_n = 3n + b\) for some appropriate value of \(b\). As we want \(a_1=2\), we set \(b=-1\). Thus \(a_n = 3n-1\).
- First notice how the sign changes from term to term. This is most commonly accomplished by multiplying the terms by either \((-1)^n\) or \((-1)^{n+1}\). Using \((-1)^n\) multiplies the odd terms by \((-1)\); using \((-1)^{n+1}\) multiplies the even terms by \((-1)\). As this sequence has negative even terms, we will multiply by \((-1)^{n+1}\).

After this, we might feel a bit stuck as to how to proceed. At this point, we are just looking for a pattern of some sort: what do the numbers 2, 5, 10, 17, etc., have in common? There are many correct answers, but the one that we'll use here is that each is one more than a perfect square. That is, \(2=1^1+1\), \(5=2^2+1\), \(10=3^2+1\), etc. Thus our formula is \(a_n= (-1)^{n+1}(n^2+1)\). - One who is familiar with the factorial function will readily recognize these numbers. They are \(0!\), \(1!\), \(2!\), \(3!\), etc. Since our sequences start with \(n=1\), we cannot write \(a_n = n!\), for this misses the \(0!\) term. Instead, we shift by 1, and write \(a_n = (n-1)!\).
- This one may appear difficult, especially as the first two terms are the same, but a little ``sleuthing'' will help. Notice how the terms in the numerator are always multiples of 5, and the terms in the denominator are always powers of 2. Does something as simple as \(a_n = \frac{5n}{2^n}\) work?

When \(n=1\), we see that we indeed get \(5/2\) as desired. When \(n=2\), we get \(10/4 = 5/2\). Further checking shows that this formula indeed matches the other terms of the sequence.

A common mathematical endeavor is to create a new mathematical object (for instance, a sequence) and then apply previously known mathematics to the new object. We do so here. The fundamental concept of calculus is the limit, so we will investigate what it means to find the limit of a sequence.

Definition 28 LIMIT OF A SEQUENCE, CONVERGENT, DIVERGENT

Let \(\{a_n\}\) be a sequence and let \(L\) be a real number. Given any \(\epsilon>0\), if an \(m\) can be found such that \(|a_n-L|<\epsilon\) for all \(n>m\), then we say the **limit **of \(\{a_n\}\), **as **\(n\) **approaches infinity**, **is **\(L\), denoted \[\lim\limits_{n\to\infty}a_n = L.\]

If \(\lim\limits_{n\to\infty} a_n\) exists, we say the sequence **converges**; otherwise, the sequence **diverges**.

This definition states, informally, that if the limit of a sequence is \(L\), then if you go far enough out along the sequence, all subsequent terms will be* really close* to \(L\). Of course, the terms "far enough'' and "really close'' are subjective terms, but hopefully the intent is clear.

This definition is reminiscent of the \(\epsilon\)--\(\delta\) proofs of Chapter 1. In that chapter we developed other tools to evaluate limits apart from the formal definition; we do so here as well.

tHEOREM 55: LIMIT OF A SEQUENCE

Let \(\{a_n\}\) be a sequence and let \(f(x)\) be a function whose domain contains the positive real numbers where \(f(n) = a_n\) for all \(n\) in \(\mathbb{N}\).

Theorem 55 allows us, in certain cases, to apply the tools developed in Chapter 1 to limits of sequences. Note two things *not* stated by the theorem:

- If \(\lim\limits_{x\to\infty}f(x)\) does not exist, we cannot conclude that \(\lim\limits_{n\to\infty} a_n\) does not exist. It may, or may not, exist. For instance, we can define a sequence \(\{a_n\} = \{\cos(2\pi n)\}\). Let \(f(x) = \cos (2\pi x)\). Since the cosine function oscillates over the real numbers, the limit \(\lim\limits_{x\to\infty}f(x)\) does not exist.

However, for every positive integer \(n\), \(\cos(2\pi n) = 1\), so \(\lim\limits_{n\to\infty} a_n = 1\). - If we cannot find a function \(f(x)\) whose domain contains the positive real numbers where \(f(n) = a_n\) for all \(n\) in \(\mathbb{N}\), we cannot conclude \(\lim\limits_{n\to\infty} a_n\) does not exist. It may, or may not, exist.

Example \(\PageIndex{3}\): Determining convergence/divergence of a sequence

Determine the convergence or divergence of the following sequences.

- \(\{a_n\} = \left\{\frac{3n^2-2n+1}{n^2-1000}\right\}\)
- \(\{a_n\} = \{\cos n \}\)
- \(\{a_n\} = \left\{\frac{(-1)^n}{n}\right\}\)

**Solution**

- Using Theorem 11, we can state that \(\lim\limits_{x\to\infty} \frac{3x^2-2x+1}{x^2-1000} = 3\). (We could have also directly applied l'H\^opital's Rule.) Thus the sequence \(\{a_n\}\) converges, and its limit is 3. A scatter plot of every 5 values of \(a_n\) is given in Figure 8.2 (a). The values of \(a_n\) vary widely near \(n=30\), ranging from about \(-73\) to \(125\), but as \(n\) grows, the values approach 3.

- The limit \(\lim\limits_{x\to\infty}\cos x\) does not exist, as \(\cos x\) oscillates (and takes on every value in \([-1,1]\) infinitely many times). Thus we cannot apply Theorem 55.

The fact that the cosine function oscillates strongly hints that \(\cos n\), when \(n\) is restricted to \(\mathbb{N}\), will also oscillate. Figure 8.2 (b), where the sequence is plotted, shows that this is true. Because only discrete values of cosine are plotted, it does not bear strong resemblance to the familiar cosine wave.

We conclude that \(\lim\limits_{n\to\infty}a_n\) does not exist. - We cannot actually apply Theorem 55 here, as the function \(f(x) = (-1)^x/x\) is not well defined. (What does \((-1)^{\sqrt{2}}\) mean? In actuality, there is an answer, but it involves
*complex analysis*, beyond the scope of this text.) So for now we say that we cannot determine the limit. (But we will be able to very soon.) By looking at the plot in Figure 8.2 (c), we would like to conclude that the sequence converges to 0. That is true, but at this point we are unable to decisively say so.

It seems that \(\{(-1)^n/n\}\) converges to 0 but we lack the formal tool to prove it. The following theorem gives us that tool.

THEOREM 56: ABSOLUTE VALUE THEOREM

Let \(\{a_n\}\) be a sequence. If \( \lim\limits_{n\to\infty} |a_n| = 0\), then \( \lim\limits_{n\to\infty} a_n = 0\)

Example \(\PageIndex{4}\): Determining the convergence/divergence of a sequence

Determine the convergence or divergence of the following sequences.

- \(\{a_n\} = \left\{\frac{(-1)^n}{n}\right\}\)
- \( \{a_n\} = \left\{\frac{(-1)^n(n+1)}{n}\right\}\)

**Solution**

- This appeared in Example 8.1.1. We want to apply Theorem 56, so consider the limit of \(\{|a_n|\}\):

\[\begin{align*}\lim\limits_{n\to\infty} |a_n| &= \lim\limits_{n\to\infty} \left|\frac{(-1)^n}{n}\right| \\ &= \lim\limits_{n\to\infty} \frac{1}{n} \\ &= 0. \end{align*}\]

Since this limit is 0, we can apply Theorem 56 and state that \(\lim\limits_{n\to\infty} a_n=0\). - Because of the alternating nature of this sequence (i.e., every other term is multiplied by \(-1\)), we cannot simply look at the limit \( \lim\limits_{x\to\infty} \frac{(-1)^x(x+1)}{x}\). We can try to apply the techniques of Theorem 56:

\[\begin{align*}\lim\limits_{n\to\infty} |a_n| &= \lim\limits_{n\to\infty} \left|\frac{(-1)^n(n+1)}{n}\right| \\ &= \lim\limits_{n\to\infty} \frac{n+1}{n}\\ &= 1. \end{align*}\]

We have concluded that when we ignore the alternating sign, the sequence approaches 1. This means we cannot apply Theorem 56; it states the the limit must be 0 in order to conclude anything.

Since we know that the signs of the terms alternate*and*we know that the limit of \(|a_n|\) is 1, we know that as \(n\) approaches infinity, the terms will alternate between values close to 1 and \(-1\), meaning the sequence diverges. A plot of this sequence is given in Figure 8.3.

We continue our study of the limits of sequences by considering some of the properties of these limits.

THEOREM 57: Properties of the Limits of Sequences

Let \(\{a_n\}\) and \(\{b_n\}\) be sequences such that \( \lim\limits_{n\to\infty} a_n = L\), \(s \lim\limits_{n\to\infty} b_n = K\), and let \(c\) be a real number.

\(\begin{align} &1. \lim\limits_{n\to\infty} (a_n\pm b_n) = L\pm K \qquad \qquad \qquad &&3.\lim\limits_{n\to\infty} (a_n/b_n) = L/K, K\neq 0 \nonumber \\ &2.\lim\limits_{n\to\infty} (a_n\cdot b_n) = L\cdot K \qquad \qquad \qquad &&4. \lim\limits_{n\to\infty} c\cdot a_n = c\cdot L \nonumber \end{align}\)

Example \(\PageIndex{5}\): Applying properties of limits of sequences

Let the following sequences, and their limits, be given:

- \( \{a_n\} = \left\{\frac{n+1}{n^2}\right\}\), and \( \lim\limits_{n\to\infty} a_n = 0\);
- \( \{b_n\} = \left\{\left(1+\frac1n\right)^{n}\right\}\), and \( \lim\limits_{n\to\infty} b_n = e\); and
- \( \{c_n\} = \big\{n\cdot \sin (5/n)\big\}\), and \( \lim\limits_{n\to\infty} c_n = 5\).

Evaluate the following limits.

1. \( \lim\limits_{n\to\infty} (a_n+b_n) \qquad 2. \lim\limits_{n\to\infty} (b_n\cdot c_n) \qquad 3. \lim\limits_{n\to\infty} (1000\cdot a_n)\)

**Solution**

We will use Theorem 57 to answer each of these.

- Since \( \lim\limits_{n\to\infty} a_n = 0\) and \( \lim\limits_{n\to\infty} b_n = e\), we conclude that \( \lim\limits_{n\to\infty} (a_n+b_n) = 0+e = e.\) So even though we are adding something to each term of the sequence \(b_n\), we are adding something so small that the final limit is the same as before.
- Since \( \lim\limits_{n\to\infty} b_n = e\) and \( \lim\limits_{n\to\infty} c_n = 5\), we conclude that \( \lim\limits_{n\to\infty} (b_n\cdot c_n) = e\cdot 5 = 5e.\)
- Since \( \lim\limits_{n\to\infty} a_n = 0\), we have \( \lim\limits_{n\to\infty} 1000a_n =1000\cdot 0 = 0\). It does not matter that we multiply each term by 1000; the sequence still approaches 0. (It just takes longer to get close to 0.)

There is more to learn about sequences than just their limits. We will also study their range and the relationships terms have with the terms that follow. We start with some definitions describing properties of the range.

Definition 29 Bounded and unbounded sequences

A sequence \(\{a_n\}\) is said to be **bounded **if there exists real numbers \(m\) and \(M\) such that \(m < a_n < M\) for all \(n\) in \(\mathbb{N}\).

A sequence \(\{a_n\}\) is said to be **unbounded **if it is not bounded.

A sequence \(\{a_n\}\) is said to be **bounded above** if there exists an \(M\) such that \(a_n < M\) for all \(n\) in \(\mathbb{N}\); it is **bounded below** if there exists an \(m\) such that \(m<a_n\) for all \(n\) in \(\mathbb{N}\).

It follows from this definition that an unbounded sequence may be bounded above or bounded below; a sequence that is both bounded above and below is simply a bounded sequence.

Example \(\PageIndex{6}\): Determining boundedness of sequences

Determine the boundedness of the following sequences.

- \(\{a_n\} = \left\{\frac1n\right\}\
- \( \{a_n\} = \{2^n\}\)

**Solution**

- The terms of this sequence are always positive but are decreasing, so we have \(0<a_n<2\) for all \(n\). Thus this sequence is bounded. Figure 8.4(a) illustrates this.

- The terms of this sequence obviously grow without bound. However, it is also true that these terms are all positive, meaning \(0<a_n\). Thus we can say the sequence is unbounded, but also bounded below. Figure 8.4(b) illustrates this.

The previous example produces some interesting concepts. First, we can recognize that the sequence \(\left\{1/n\right\}\) converges to 0. This says, informally, that "most'' of the terms of the sequence are "really close'' to 0. This implies that the sequence is bounded, using the following logic. First, "most'' terms are near 0, so we could find some sort of bound on these terms (using Definition 28, the bound is \(\epsilon\)). That leaves a "few'' terms that are not near 0 (i.e., a *finite *number of terms). A finite list of numbers is always bounded.

This logic implies that if a sequence converges, it must be bounded. This is indeed true, as stated by the following theorem.

THEOREM 58 CONVERGENT SEQUENCES ARE BOUNDED

Let \( \left\{a_n\right\}\) be a convergent sequence. Then \(\{a_n\}\) is bounded.

In Example 8.1.5 we saw the sequence \( \{b_n\} = \left\{\left(1+1/n\right)^{n}\right\}\), where it was stated that \( \lim\limits_{n\to\infty} b_n = e\). (Note that this is simply restating part of Theorem 5.) Even though it may be difficult to intuitively grasp the behavior of this sequence, we know immediately that it is bounded.

Another interesting concept to come out of Example 8.1.6 again involves the sequence \(\{1/n\}\). We stated, without proof, that the terms of the sequence were decreasing. That is, that \(a_{n+1} < a_n\) for all \(n\). (This is easy to show. Clearly \(n < n+1\). Taking reciprocals flips the inequality: \(1/n > 1/(n+1)\). This is the same as \(a_n > a_{n+1}$.) Sequences that either steadily increase or decrease are important, so we give this property a name.

Definition 30 MONOTONIC SEQUENCES

- A sequence \(\{a_n\}\) is
**monotonically increasing**if \(a_n \leq a_{n+1}\) for all \(n\), i.e.,

\[a_1 \leq a_2 \leq a_3 \leq \cdots a_n \leq a_{n+1} \cdots\] - A sequence \(\{a_n\}\) is
**monotonically decreasing**if \(a_n \geq a_{n+1}\) for all \(n\), i.e.,

\[a_1 \geq a_2 \geq a_3 \geq \cdots a_n \geq a_{n+1} \cdots\] - A sequence is
**monotonic**if it is monotonically increasing or monotonically decreasing.

**NOTE:** It is sometimes useful to call a monotonically increasing sequence *strictly increasing* if \(a_n < a_{n+1}\) for all \(n\); i.e, we remove the possibility that subsequent terms are equal. A similar statement holds for *strictly *decreasing.

Example \(\PageIndex{7}\): Determining monotonicity

Determine the monotonicity of the following sequences.

\(\begin{align} &1.\{a_n\} = \left\{\frac{n+1}n\right\} \qquad \qquad \qquad &&3.\{a_n\} = \left\{\frac{n^2-9}{n^2-10n+26}\right\} \nonumber \\ &2.\{a_n\} = \left\{\frac{n^2+1}{n+1}\right\}\qquad \qquad \qquad &&4. \{a_n\} = \left\{\frac{n^2}{n!}\right\}\nonumber \end{align}\)

**Solution**

In each of the following, we will examine \(a_{n+1}-a_n\). If \(a_{n+1}-a_n >0\), we conclude that \(a_n<a_{n+1}\) and hence the sequence is increasing. If \(a_{n+1}-a_n<0\), we conclude that \(a_n>a_{n+1}\) and the sequence is decreasing. Of course, a sequence need not be monotonic and perhaps neither of the above will apply.

We also give a scatter plot of each sequence. These are useful as they suggest a pattern of monotonicity, but analytic work should be done to confirm a graphical trend.

- \[\begin{align} a_{n+1}-a_n &= \frac{n+2}{n+1} - \frac{n+1}{n} \\ &= \frac{(n+2)(n)-(n+1)^2}{(n+1)n} \\ &= \frac{-1}{n(n+1)} \\ &<0 \quad\text{ for all \(n\).}\end{align}\]

Since \(a_{n+1}-a_n<0\) for all \(n\), we conclude that the sequence is decreasing.

- \[ \begin{align} a_{n+1}-a_n &= \frac{(n+1)^2+1}{n+2} - \frac{n^2+1}{n+1} \\ &= \frac{\big((n+1)^2+1\big)(n+1)- (n^2+1)(n+2)}{(n+1)(n+2)}\\ &= \frac{n^2+4n+1}{(n+1)(n+2)} \\ &> 0 \quad \text{ for all \(n\).}\end{align}\]

Since \(a_{n+1}-a_n>0\) for all \(n\), we conclude the sequence is increasing.

- We can clearly see in Figure 8.5 (c), where the sequence is plotted, that it is not monotonic. However, it does seem that after the first 4 terms it is decreasing. To understand why, perform the same analysis as done before:

\[\begin{align}a_{n+1}-a_n &= \frac{(n+1)^2-9}{(n+1)^2-10(n+1)+26} - \frac{n^2-9}{n^2-10n+26} \\ &= \frac{n^2+2n-8}{n^2-8n+17}-\frac{n^2-9}{n^2-10n+26}\\ &= \frac{(n^2+2n-8)(n^2-10n+26)-(n^2-9)(n^2-8n+17)}{(n^2-8n+17)(n^2-10n+26)}\\ &= \frac{-10n^2+60n-55}{(n^2-8n+17)(n^2-10n+26)}.\end{align}\]

We want to know when this is greater than, or less than, 0. The denominator is always positive, therefore we are only concerned with the numerator. Using the quadratic formula, we can determine that \(-10n^2+60n-55=0\) when \(n\approx 1.13, 4.87\). So for \(n<1.13\), the sequence is decreasing. Since we are only dealing with the natural numbers, this means that \(a_1 > a_2\).

Between \(1.13\) and \(4.87\), i.e., for \(n=2\), 3 and 4, we have that \(a_{n+1}>a_n\) and the sequence is increasing. (That is, when \(n=2\), 3 and 4, the numerator \(-10n^2+60n+55\) from the fraction above is \(>0\).)

When \(n> 4.87\), i.e, for \(n\geq 5\), we have that \(-10n^2+60n+55<0\), hence \(a_{n+1}-a_n<0\), so the sequence is decreasing.

In short, the sequence is simply not monotonic. However, it is useful to note that for \(n\geq 5\), the sequence is monotonically decreasing. - Again, the plot in Figure 8.6 shows that the sequence is not monotonic, but it suggests that it is monotonically decreasing after the first term. We perform the usual analysis to confirm this.

\[\begin{align} a_{n+1}-a_n &= \frac{(n+1)^2}{(n+1)!} - \frac{n^2}{n!} \\ &= \frac{(n+1)^2-n^2(n+1)}{(n+1)!} \\ &= \frac{-n^3+2n+1}{(n+1)!}\end{align}\]

When \(n=1\), the above expression is \(>0\); for \(n\geq 2\), the above expression is \(<0\). Thus this sequence is not monotonic, but it is monotonically decreasing after the first term.

Knowing that a sequence is monotonic can be useful. In particular, if we know that a sequence is bounded and monotonic, we can conclude it converges! Consider, for example, a sequence that is monotonically decreasing and is bounded below. We know the sequence is always getting smaller, but that there is a bound to how small it can become. This is enough to prove that the sequence will converge, as stated in the following theorem.

THEOREM 59 BOUNDED MONOTONIC SEQUENCES ARE CONVERGENT

- Let \(\{a_n\}\) be a bounded, monotonic sequence. Then \(\{a_n\}\) converges; i.e., \( \lim\limits_{n \to\infty}a_n\) exists.
- Let \(\{a_n\}\) be a monotonically increasing sequence that is bounded above. Then \(\{a_n\}\) converges.
- Let \(\{a_n\}\) be a monotonically decreasing sequence that is bounded below. Then \(\{a_n\}\) converges.

Consider once again the sequence \(\{a_n\} = \{1/n\}\). It is easy to show it is monotonically decreasing and that it is always positive (i.e., bounded below by 0). Therefore we can conclude by Theorem 59 that the sequence converges. We already knew this by other means, but in the following section this theorem will become very useful.

Sequences are a great source of mathematical inquiry. The On-Line Encyclopedia of Integer Sequences http://oeis.org contains thousands of sequences and their formulae. (As of this writing, there are 257,537 sequences in the database.) Perusing this database quickly demonstrates that a single sequence can represent several different ``real life'' phenomena.

Interesting as this is, our interest actually lies elsewhere. We are more interested in the *sum* of a sequence. That is, given a sequence \(\{a_n\}\), we are very interested in \(a_1+a_2+a_3+\cdots\). Of course, one might immediately counter with "Doesn't this just add up to `infinity'?'' Many times, yes, but there are many important cases where the answer is no. This is the topic of *series*, which we begin to investigate in the next section.

## Contributors and Attributions

Gregory Hartman (Virginia Military Institute). Contributions were made by Troy Siemers and Dimplekumar Chalishajar of VMI and Brian Heinold of Mount Saint Mary's University. This content is copyrighted by a Creative Commons Attribution - Noncommercial (BY-NC) License. http://www.apexcalculus.com/