Precalculus with Integrated CalculusXYZ Homework Edition

⇩ Download ▾

10.1 Sequences

In this section, we introduce sequences which are an important class of functions whose domains are, more or less, the set of natural numbers.1 Before we get to far ahead of ourselves, let's look at what the term `sequence' means mathematically. Informally, we can think of a sequence as an infinite list of numbers. For example, consider the sequence

1 2 , 3 4 , 9 8 , 27 16 ,

(10.1)

As usual, the periods of ellipsis, , indicate that the proposed pattern continues forever. Each of the numbers in the list is called a term, and we call 1 2 the `first term', 3 4 the `second term', 9 8 the `third term' and so forth. In numbering them this way, we are setting up a function, which we'll call ` a ' per tradition, between the natural numbers and the terms in the sequence.

n a ( n ) 1 1 2 2 3 4 3 9 8 4 27 16

In other words, a ( n ) is the n th term in the sequence. We formalize these ideas in our definition of a sequence and introduce some accompanying notation.

Applying the notation provided in Definition 10.1 to the sequence given (Equation 10.1), we have a 1 = 1 2 , a 2 = 3 4 , a 3 = 9 8 .

Suppose we wanted to know a 117 , that is, the 117 th term in the sequence. While the pattern of the sequence is apparent, it would benefit us greatly to have an explicit formula for a n . Unfortunately, there is no general algorithm that will produce a formula for every sequence, so any formulas we do develop will come from that greatest of teachers, experience. In other words, it is time for an example.

Some remarks about Example 10.1.1 are in order. We first note that since sequences are functions, we can graph them in the same way we graph functions. For example, if we wish to graph the sequence { b k } k = 0 from Example 10.1.1, we graph the equation y = b ( k ) for the values k 0 . That is, we plot the points ( k , b ( k ) ) for the values of k in the domain, k = 0 , 1 , 2 , . The resulting collection of points is the graph of the sequence. Note that we do not connect the dots in a pleasing fashion as we are used to doing, because the domain is just the whole numbers in this case, not a collection of intervals of real numbers.2

Coordinate-plane figure.
Figure 10.1

Graphing y = b k = ( 1 ) k 2 k + 1 , k 0

Speaking of { b k } k = 0 , the astute and mathematically minded reader will correctly note that this technically isn't a sequence, since according to Definition 10.1, sequences are functions whose domains are the natural numbers, not the whole numbers, as is the case with { b k } k = 0 . In other words, to satisfy Definition 10.1, we need to shift the variable k so it starts at k = 1 instead of k = 0 .

To see how we can do this, it helps to think of the problem graphically. What we want is to shift the graph of y = b ( k ) to the right one unit, and thinking back to Section 5.4, we can accomplish this by replacing k with k 1 in the definition of { b k } k = 0 .

Specifically, let c k = b k 1 where k 1 0 . We get c k = ( 1 ) k 1 2 ( k 1 ) + 1 = ( 1 ) k 1 2 k 1 , where now k 1 . We leave to the reader to verify that { c k } k = 1 generates the same list of numbers as does { b k } k = 0 , but the former satisfies Definition 10.1, while the latter does not.

Like so many things in this text, we acknowledge that this point is pedantic and join the vast majority of authors who adopt a more relaxed view of Definition 10.1 to include any function which generates a list of numbers which can then be matched up with the natural numbers.3

One last note about Example 10.1.1 concerns the manner in which the sequences in numbers and are defined. We say these two sequences are described `recursively.' In each instance, an initial value of the sequence is given which is then followed by a recursion equation a formula which enables us to use known terms of the sequence to determine other terms.

The terms of the sequence from number is given notation and name: f n = n ! is called n -factorial. Using the `!' notation, we can describe the factorial sequence as: 0 ! = 1 and n ! = n ( n 1 ) ! for n 1 .

After 0 ! = 1 the next four terms, written out in detail, are 1 ! = 1 0 ! = 1 1 = 1 , 2 ! = 2 1 ! = 2 1 = 2 , 3 ! = 3 2 ! = 3 2 1 = 6 and 4 ! = 4 3 ! = 4 3 2 1 = 24 . From this, we see a more informal way of computing n ! , which is n ! = n ( n 1 ) ( n 2 ) 2 1 with 0 ! = 1 as a special case. (We will study factorials in greater detail in Section 10.4.)4

While none of the sequences in Example 10.1.1 worked out to be the sequence in (Equation 10.1), they do give us some insight into what kinds of patterns to look for. Two patterns in particular are given in the next definition.

In English, an arithmetic sequence is one in which we proceed from one term to the next by always adding the fixed number d . If this sort of `constant change' idea sounds familiar, it should. Indeed, arithmetic sequences are merely linear functions, something we will explore in more detail shortly. Note the name `common difference' comes from a slight rewrite of the recursion equation from a n + 1 = a n + d to a n + 1 a n = d . That is, every pair of successive terms has the same or common difference, d .

Analogously, a geometric sequence is one in which we proceed from one term to the next by always multiplying by the same fixed number r . If this notion sounds familiar, it is because geometric sequences are, in fact, exponential functions. Again, we will explore this connection in more detail later. We note that if a n 0 , we can rearrange the recursion equation to get a n + 1 a n = r . Hence, every pair of successive terms has the same or common ratio, r .

Some sequences are arithmetic, some are geometric and some are neither as the next example illustrates.6

We are now one step away from determining an explicit formula for the sequence given in (Equation 10.1). We know that it is a geometric sequence and our next result gives us the explicit formula we require.

An intuitive way to arrive at Equation 10.1 appeals to Definition 10.2 directly. Given an arithmetic sequence with first term a and common difference d , the way we get from one term to the next is by adding d . Hence, the terms of the sequence are: a , a + d , a + 2 d , a + 3 d , …. We see that to reach the n th term, we add d to a exactly ( n 1 ) times, which is exactly what the formula says.7

Note if we rewrite the formula a n = a 1 + ( n 1 ) d using traditional function notation as a ( n ) = a ( 1 ) + d ( n 1 ) we can see arithmetic sequences are linear functions.8 Indeed, relabeling the function a as ` f ' and the independent variable n as ` x ,' we can make the identifications x 0 = 1 , and m = d so as to put the equation a ( n ) = a ( 1 ) + d ( n 1 ) into the form of Equation 1.1:

a ( n ) = a ( 1 ) + d ( n 1 ) f ( x ) = f ( 1 ) + m ( x 1 )

Hence, arithmetic sequences are linear functions with slope d whose domains are the natural numbers.

The derivation of the formula for geometric series follows similarly. Here, we start with the first term a and go from one term to the next by multiplying by r . We get a , a r , a r 2 , a r 3 and so forth. The n th term results from multiplying a by r exactly ( n 1 ) times.9

In the same way arithmetic sequences are linear functions, geometric sequences are exponential functions. Writing a n = a 1 r n 1 as a ( n ) = a ( 1 ) r n 1 , we can relabel a as f and n as x and make the identifications x 0 = 1 and b = r to put the equation into the form described in Definition 7.2:

a ( n ) = a ( 1 ) r n 1 f ( x ) = f ( 1 ) b x 1

So, geometric sequences are exponential functions with base r whose domains are the natural numbers.

With Equation 10.1 in place, we finally have the tools required to find an explicit formula for the n th term of the sequence given in (Equation 10.1). We know from Example 10.1.2 that it is geometric with common ratio r = 3 2 . The first term is a = 1 2 so by Equation 10.1 we get a n = a r n 1 = 1 2 ( 3 2 ) n 1 for n 1 . After a touch of simplifying, we get a n = ( 3 ) n 1 2 n for n 1 . Note that we can easily check our answer by substituting in values of n and seeing that the formula generates the sequence given in (Equation 10.1). We leave this to the reader. In particular, the 117th term in the sequence is a 117 = 1 2 ( 3 2 ) 117 1 = 3 116 2 117 .

Our next example gives us more practice finding patterns.

While the last problem in Example 10.1.3 was neither geometric nor arithmetic, it did resolve into a combination of these two kinds of sequences. If handed the sequence 2 , 5 , 10 , 17 , , we would be hard-pressed to find a formula for a n if we restrict our attention to these two archetypes. We said before that there is no general algorithm for finding the explicit formula for the n th term of a given sequence, and it is only through experience gained from evaluating sequences from explicit formulas that we learn to begin to recognize number patterns.

The pattern 1 , 4 , 9 , 16 , is rather recognizable as the squares, so the formula a n = n 2 , n 1 may not be too hard to determine. With this in mind, it's possible to see 2 , 5 , 10 , 17 , as the sequence 1 + 1 , 4 + 1 , 9 + 1 , 16 + 1 , , so that a n = n 2 + 1 , n 1 .

Of course, since we are given only a small sample of the sequence, we shouldn't be too disappointed to find out this isn't the only formula which generates this sequence. For example, consider the sequence defined by b n = 1 4 n 4 + 5 2 n 3 31 4 n 2 + 25 2 n 5 , n 1 . The reader is encouraged to verify that it also produces the terms 2 , 5 , 10 , 17 . In fact, it can be shown that given any finite sample of a sequence, there are infinitely many explicit formulas all of which generate those same finite points. This means that there will be infinitely many correct answers to some of the exercises in this section.11 Just because your answer doesn't match ours doesn't mean it's wrong. As always, when in doubt, write your answer out. As long as it produces the same terms in the same order as what the problem wants, your answer is correct.

Sequences play a major role in the Mathematics of Finance, as we have already seen with Equation 7.2 in Section 7.6. Recall that if we invest P dollars at an annual percentage rate r and compound the interest n times per year, the formula for A k , the amount in the account after k compounding periods, is A k = P ( 1 + r n ) k = [ P ( 1 + r n ) ] ( 1 + r n ) k 1 , k 1 . We leave it to the reader to show this is a geometric sequence with first term P ( 1 + r n ) and common ratio ( 1 + r n ) .

In section 7.6, we showed lim n P ( 1 + r n ) n t = P e r t , where we noted, at the time, that the limit here was taken on a discrete, rather than continuous variable. That didn't stop us from using the limit properties listed in Theorem 6.2. We talk more on the limits of sequences next.

Limits of Sequences

Consider the sequence a n = 3 n n + 1 , n 1 . Suppose we wished to find lim n a n .

We should first note that even though the domain of the sequence a n is discrete, we can nonetheless discuss what happens as n since for any real number M > 0 , we can find a natural number n > M . (We could, for instance take n = M + 1 .)

Next, note that we can visualize the sequence a n = 3 n n + 1 , n 1 as being points on the graph of f ( x ) = 3 x x + 1 :

Image: sequenceoncurve
Figure 10.2

Comparing leading terms of numerator and denominator, as x , 3 x x + 1 3 x x = 3 . Hence, lim x 3 x x + 1 = 3 , which means all of the y -values on the graph of y = f ( x ) , including the y -values of the graph of the sequence, approach 3 as x . It stands to reason, then that lim n 3 n n + 1 = 3 .

The long and short of the above argument is that since lim x 3 x x + 1 exists, lim n 3 n n + 1 = lim x 3 x x + 1 . While the syntax of ` lim n 3 n n + 1 = lim x 3 x x + 1 ' appears to be just a switch in a dummy variable,12 the switch from ` n ' to ` x ' indicates switching from a discrete variable to a continuous one. This sort of maneuver is called passing to a continuous variable and is one of the primary ways we can use what we've already studied to analyze limits of sequences.

Note the phrase ` f ( n ) = a n for all n k for some natural number k ' indicates the focus on what is happening as n . In other words, the first finitely many sequence values do not impact the value of lim n a n . We are just concerned with the long-run or end behavior here. The reason Theorem 10.1 works, indeed why all of the limit properties discussed in Section 6.1 work with sequences as well as functions of continuous variables is because the formal definitions associated with limits of both sequences and functions share the same mathematical `bones.' (See a Calculus instructor for more details.) We'll explore these connections more deeply in the Exercises.

We have special words to describe sequences which have limits and those which do not.

The sequence in number in Example 10.1.4 is an example of an alternating sequence, so-named because the terms alternate in sign. Alternating sequences play a large role in the study of infinite series (whatever those are) in Calculus,14 so it is worth pointing them out here.

Next, the reasoning we used to determine lim n ( 1 ) n n 2 + 1 = 0 is sound and is codified in the following theorem. We state the result for both sequences (discrete functions) and (continuous) functions.

The Squeeze Theorem is so-named because the two sequences (functions) which bound the middle sequence (function) `squeeze' the middle function to the common limit, L .

Image: squeezethm
Figure 10.6

The graph of y = f ( x ) being `squeezed' to a common limit by the graphs of y = g ( x ) and y = h ( x ) .

Passing to a continuous variable in conjunction with the Squeeze Theorem can be used to prove certain classes of Geometric Sequences converge. We have the following:

We encourage the reader to think through each of the cases stated in Theorem 10.3 to make sure the conclusions seem reasonable. We'll have occasion to cite Theorem 10.3 in the next section. For now, it's time for some Exercises.

Exercises

In Exercises -, write out the first four terms of the given sequence.

  1. a n = 2 n 1 , n 0
  2. d j = ( 1 ) j ( j + 1 ) 2 , j 1
  3. { 5 k 2 } k = 1
  4. { n 2 + 1 n + 1 } n = 0
  5. { x n n 2 } n = 1
  6. { ln ( n ) n } n = 1
  7. a 1 = 3 , a n + 1 = a n 1 , n 1
  8. d 0 = 12 , d m = d m - 1 100 , m 1
  9. b 1 = 2 , b k + 1 = 3 b k + 1 , k 1
  10. c 0 = 2 , c j = c j - 1 ( j + 1 ) ( j + 2 ) , j 1
  11. a 1 = 117 , a n + 1 = 1 a n , n 1
  12. s 0 = 1 , s n + 1 = x n + 1 + s n , n 0
  13. F 0 = 1 , F 1 = 1 , F n = F n - 1 + F n - 2 , n 2 (This is the famous Fibonacci Sequence )

In Exercises - determine if the given sequence is arithmetic, geometric or neither. If it is arithmetic, find the common difference d ; if it is geometric, find the common ratio r .

  1. { 3 n 5 } n = 1
  2. a n = n 2 + 3 n + 2 , n 1
  3. 1 3 , 1 6 , 1 12 , 1 24 , …
  4. { 3 ( 1 5 ) n 1 } n = 1
  5. 17 , 5 , 7 , 19 , …
  6. 2 , 22 , 222 , 2222 , …
  7. 0.9 , 9 , 90 , 900 , …
  8. a n = n ! 2 , n 0 .

In Exercises -, find an explicit formula for the n th term of the given sequence.15

  1. 3 , 5 , 7 , 9 , …
  2. 1 , 1 2 , 1 4 , 1 8 , …
  3. 1 , 2 3 , 4 5 , 8 7 , …
  4. 1 , 2 3 , 1 3 , 4 27 , …
  5. 1 , 1 4 , 1 9 , 1 16 , …
  6. x , x 3 3 , x 5 5 , x 7 7 , …
  7. 0.9 , 0.99 , 0.999 , 0.9999 ,
  8. 27 , 64 , 125 , 216 ,
  9. 1 , 0 , 1 , 0 ,

In Exercises -, find the indicated limit by using Theorem 10.1 and passing to a continuous variable.16

  1. lim n 2 n 2 3 n + 1 4 n 2
  2. lim k k 2 + 7 k 3 3 k k 3
  3. lim m 117 m 42 + 3 m + 1 e 2 m + 6

In Exercises -, use the Squeeze Theorem, Theorem 10.2 to help you determine the limit.17

  1. lim n ( 1 ) n 3 n + 1
  2. lim k 1 ( 2 3 ) k
  3. lim m ( 1 ) m 2 m 2 m !
  4. Find a sequence which is both arithmetic and geometric. (Hint: Start with a n = c for all n .)
  5. Show that a geometric sequence can be transformed into an arithmetic sequence by taking the natural logarithm of the terms.
  6. Thomas Robert Malthus is credited with saying, “The power of population is indefinitely greater than the power in the earth to produce subsistence for man. Population, when unchecked, increases in a geometrical ratio. Subsistence increases only in an arithmetical ratio. A slight acquaintance with numbers will show the immensity of the first power in comparison with the second.” (See this webpage for more information.) Discuss this quote with your classmates from a sequences point of view.
  7. This classic problem involving sequences shows the power of geometric sequences. Suppose that a wealthy benefactor agrees to give you one penny today and then double the amount she gives you each day for 30 days. So, for example, you get two pennies on the second day and four pennies on the third day. How many pennies do you get on the 30 th day? What is the total dollar value of the gift you have received?
  8. Research the terms `arithmetic mean' and `geometric mean.' With the help of your classmates, show that a given term of a arithmetic sequence a k , k 2 is the arithmetic mean of the term immediately preceding, a k 1 it and immediately following it, a k + 1 . State and prove an analogous result for geometric sequences.
  9. Discuss with your classmates how the results of this section might change if we were to examine sequences of other mathematical things like complex numbers or matrices. Find an explicit formula for the n th term of the sequence i , 1 , i , 1 , i , . List out the first four terms of the matrix sequences we discussed in Exercise in Section 9.3.

Answers

  1. 0 , 1 , 3 , 7
  2. 1 , 1 , 1 , 1
  3. 3 , 8 , 13 , 18
  4. 1 , 1 , 5 3 , 5 2
  5. x , x 2 4 , x 3 9 , x 4 16
  6. 0 , ln ( 2 ) 2 , ln ( 3 ) 3 , ln ( 4 ) 4
  7. 3 , 2 , 1 , 0
  8. 12 , 0.12 , 0.0012 , 0.000012
  9. 2 , 7 , 22 , 67
  10. 2 , 1 3 , 1 36 , 1 720
  11. 117 , 1 117 , 117 , 1 117
  12. 1 , x + 1 , x 2 + x + 1 , x 3 + x 2 + x + 1
  13. 1 , 1 , 2 , 3
  14. arithmetic, d = 3
  15. neither
  16. geometric, r = 1 2
  17. geometric, r = 1 5
  18. arithmetic, d = 12
  19. neither
  20. geometric, r = 10
  21. neither
  22. a n = 1 + 2 n , n 1
  23. a n = ( 1 2 ) n 1 , n 1
  24. a n = 2 n 1 2 n 1 , n 1
  25. a n = n 3 n 1 , n 1
  26. a n = 1 n 2 , n 1
  27. ( 1 ) n 1 x 2 n 1 2 n 1 , n 1
  28. a n = 10 n 1 10 n , n 1
  29. a n = ( n + 2 ) 3 , n 1
  30. a n = 1 + ( 1 ) n 1 2 , n 1
  31. lim n 2 n 2 3 n + 1 4 n 2 = 2
  32. lim k k 2 + 7 k 3 3 k k 3 = 0
  33. lim m 117 m 42 + 3 m + 1 e 2 m + 6 = 0
  34. lim n ( 1 ) n 3 n + 1 = 0
  35. lim k 1 ( 2 3 ) k = 1
  36. lim m ( 1 ) m 2 m 2 m ! = 0

Adapted from Precalculus, Preliminary 4th Edition (integrated calculus), by Carl Stitz and Jeff Zeager (stitz-zeager.com), licensed under CC BY-NC-SA 3.0. Changes were made: reformatted as an accessible XYZ web edition. License: CC-BY-NC-SA-3.0.

These eBooks are a prerelease and are not yet certified conformant with WCAG 2.1 AA or ADA Title II. Every page is built against an automated accessibility gate, and the published editions will meet ADA Title II requirements when they release in late September 2026. If something is unusable, please tell us.