Precalculus with Integrated CalculusXYZ Homework Edition

⇩ Download ▾

10.2 Summation Notation

In Section 10.1, we showed how the formula for compound interest is a geometric sequence. In retirement planning, it is seldom the case that an investor deposits a set amount of money into an account and waits for it to grow. Usually, additional payments of principal are made at regular intervals and the value of the investment grows accordingly. This kind of investment is called an annuity and will be discussed in later in this section once we have developed more mathematical machinery that enables us to add sequences.

In the previous section, we introduced sequences. Each of the numbers in the sequence is called a `term' which implies these numbers are meant to be added. To that end, we introduce the following notation which is used to describe the sum of (some of the) terms of a sequence.

In English, Definition 10.4 is simply defining a short-hand notation for adding up the terms of the sequence { a n } n = k from a m through a p . The symbol Σ is the capital Greek letter sigma and is shorthand for `sum'. The lower and upper limits of the summation tells us which term to start with and which term to end with, respectively. For example, using the sequence a n = 2 n 1 for n 1 , we can write a 3 + a 4 + a 5 + a 6 as

n = 3 6 ( 2 n 1 ) = ( 2 ( 3 ) 1 ) + ( 2 ( 4 ) 1 ) + ( 2 ( 5 ) 1 ) + ( 2 ( 6 ) 1 ) = 5 + 7 + 9 + 11 = 32

The index variable is considered a `dummy variable' in the sense that it may be changed to any letter without affecting the value of the summation. For instance,

n = 3 6 ( 2 n 1 ) = k = 3 6 ( 2 k 1 ) = j = 3 6 ( 2 j 1 )

One place you may encounter summation notation is in mathematical definitions. For example, summation notation allows us to define polynomials as functions of the form

f ( x ) = k = 0 n a k x k

for real numbers a k , k = 0 , 1 , n . The reader is invited to compare this with what is given in Definition 2.4. Summation notation is particularly useful when talking about matrix operations. For example, we can write the product of the i th row R i of a matrix A = [ a i j ] m × n and the j th column C j of a matrix B = [ b i j ] n × r as

R i C j = k = 1 n a i k b k j

Again, the reader is encouraged to write out the sum and compare it to Definition 9.8. Our next example gives us practice with this new notation.

The following theorem presents some general properties of summation notation.

There is much to be learned by thinking about why the properties hold, so we leave the proof of these properties to the reader.4

We now turn our attention to the sums involving arithmetic and geometric sequences. Given an arithmetic sequence a k = a + ( k 1 ) d for k 1 , we let S denote the sum of the first n terms. To derive a formula for S , we write it out in two different ways

S = a + ( a + d ) + + ( a + ( n 2 ) d ) + ( a + ( n 1 ) d ) S = ( a + ( n 1 ) d ) + ( a + ( n 2 ) d ) + + ( a + d ) + a

If we add these two equations and combine the terms which are aligned vertically, we get

2 S = ( 2 a + ( n 1 ) d ) + ( 2 a + ( n 1 ) d ) + + ( 2 a + ( n 1 ) d ) + ( 2 a + ( n 1 ) d )

The right hand side of this equation contains n terms, all of which are equal to ( 2 a + ( n 1 ) d ) so we get 2 S = n ( 2 a + ( n 1 ) d ) . Dividing both sides of this equation by 2 , we obtain the formula

S = n 2 ( 2 a + ( n 1 ) d )

If we rewrite the quantity 2 a + ( n 1 ) d as a + ( a + ( n 1 ) d ) = a 1 + a n , we get the formula

S = n ( a 1 + a n 2 )

A helpful way to remember this last formula is to recognize that we have expressed the sum as the product of the number of terms n and the average of the first and n th terms.

To derive the formula for the geometric sum, we start with a geometric sequence a k = a r k 1 , k 1 , and let S once again denote the sum of the first n terms. Comparing S and r S , we get

S = a + a r + a r 2 + + a r n 2 + a r n 1 r S = a r + a r 2 + + a r n 2 + a r n 1 + a r n

Subtracting the second equation from the first forces all of the terms except a and a r n to cancel out and we get S r S = a a r n . Factoring, we get S ( 1 r ) = a ( 1 r n ) . Assuming r 1 , we can divide both sides by the quantity ( 1 r ) to obtain

S = a ( 1 r n 1 r )

If we distribute a through the numerator, we get a a r n = a 1 a n + 1 which yields the formula

S = a 1 a n + 1 1 r

In the case when r = 1 , we get the formula

S = a + a + + a n  times = n a

Our results are summarized below.5

While we have made an honest effort to derive the formulas in Equation 10.2, formal proofs require the machinery in Section 10.3.

An important application of the geometric sum formula is the investment plan called an annuity. Annuities differ from the kind of investments we studied in Section 7.6 in that payments are deposited into the account on an on-going basis, and this complicates the mathematics a little.6

Suppose you have an account with annual interest rate r which is compounded n times per year. We let i = r n denote the interest rate per period. Suppose we wish to make ongoing deposits of P dollars at the end of each compounding period. Let A k denote the amount in the account after k compounding periods.

Then A 1 = P , because we have made our first deposit at the end of the first compounding period and no interest has been earned. During the second compounding period, we earn interest on A 1 so that our initial investment has grown to A 1 ( 1 + i ) = P ( 1 + i ) in accordance with Equation 7.1. Adding our second payment at the end of the second period, we get

A 2 = A 1 ( 1 + i ) + P = P ( 1 + i ) + P = P ( 1 + i ) ( 1 + 1 1 + i )

The reason for factoring out the P ( 1 + i ) will become apparent in short order. During the third compounding period, we earn interest on A 2 which then grows to A 2 ( 1 + i ) . We add our third payment at the end of the third compounding period to obtain

A 3 = A 2 ( 1 + i ) + P = P ( 1 + i ) ( 1 + 1 1 + i ) ( 1 + i ) + P = P ( 1 + i ) 2 ( 1 + 1 1 + i + 1 ( 1 + i ) 2 )

During the fourth compounding period, A 3 grows to A 3 ( 1 + i ) , and when we add the fourth payment, we factor out P ( 1 + i ) 3 to get

A 4 = P ( 1 + i ) 3 ( 1 + 1 1 + i + 1 ( 1 + i ) 2 + 1 ( 1 + i ) 3 )

This pattern continues so that at the end of the k th compounding, we get

A k = P ( 1 + i ) k 1 ( 1 + 1 1 + i + 1 ( 1 + i ) 2 + + 1 ( 1 + i ) k 1 )

The sum in the parentheses above is the sum of the first k terms of a geometric sequence with a = 1 and r = 1 1 + i . Using Equation 10.2, we get

1 + 1 1 + i + 1 ( 1 + i ) 2 + + 1 ( 1 + i ) k 1 = 1 ( 1 1 ( 1 + i ) k 1 1 1 + i ) = ( 1 + i ) ( 1 ( 1 + i ) k ) i

Hence, we get

A k = P ( 1 + i ) k 1 ( ( 1 + i ) ( 1 ( 1 + i ) k ) i ) = P ( ( 1 + i ) k 1 ) i

If we let t be the number of years this investment strategy is followed, then k = n t , and we get the formula for the future value of an ordinary annuity.

The reader is encouraged to substitute i = r n into Equation 10.3 and simplify. Some familiar equations arise which are cause for pause and meditation. One last note: if the deposit P is made a the beginning of the compounding period instead of at the end, the annuity is called an annuity-due. We leave the derivation of the formula for the future value of an annuity-due as an exercise for the reader.

Geometric Series

As defined in Section 10.1, sequences are an infinite list of numbers. So far in this section, we have concerned ourselves with adding only finitely many terms. In Calculus, infinite sums, called series are studied at great length. While we do not have the mathematical machinery to embark upon an exhaustive study here, we can nevertheless focus our attention on what is arguably one of the most prevalent and useful types of series, geometric series.

As a motivating example, consider the number 0 . 9 ¯ . We can write this number as

0 . 9 ¯ = 0.9999 = 0.9 + 0.09 + 0.009 + 0.0009 +

From Example 10.2.1, we know we can write the sum of the first n of these terms as

0 . 9 9 n  nines = .9 + 0.09 + 0.009 + 0 . 0 0 n 1  zeros 9 = k = 1 n 9 10 k

Using Equation 10.2, we have

k = 1 n 9 10 k = k = 1 n 9 10 ( 1 10 k 1 ) = k = 1 n 9 10 ( 1 10 ) k 1 = 9 10 ( 1 1 10 n 1 1 10 ) = 1 1 10 n

It stands to reason that we should define 0 . 9 ¯ = lim n ( 1 1 10 n ) . Passing to a continuous variable along with our knowledge of exponential functions gives lim n ( 1 1 10 n ) = lim x ( 1 1 10 x ) = 1 0 = 1 .

We have just argued that 0 . 9 ¯ = 1 , which may shock some readers.7

Note that in this manner, any non-terminating decimal can be thought of as an infinite sum whose denominators are the powers of 10 , so the phenomenon of adding up infinitely many terms and arriving at a finite number is not as foreign of a concept as it may appear. We have the following theorem.

The justification of the result in Theorem 10.5 comes from taking the formula in Equation 10.2 for the sum of the first n terms of a geometric sequence and taking the limit as n .

Assuming | r | < 1 means 1 < r < 1 , so per Theorem 10.3, lim n r n = 0 . Using this fact along with the Limit Properties listed in Theorem 6.2:

lim n k = 1 n a r k 1 = lim n a ( 1 r n 1 r ) = a 1 r

We'll explore what goes wrong when | r | 1 in some of the Exercises. For now, we put this theorem to good use in the following example.

We note that another popular method for converting repeating decimals to fractions goes something like this: let x = 4.2 17 ¯ . Then, 100 x = 421.7 17 ¯ . Hence, 99 x = 100 x x = 421.7 17 ¯ 4.2 17 ¯ = 417.5 . Hence, x = 417.5 99 = 835 198 . While this procedure results in the same (correct!) answer, the manipulations involved (such as the multiplication and subtraction) are actually using some of the properties listed in Theorem 10.4 extended to infinite sums via Theorem 6.2.

Area

One of the (two) major geometric problems studied in Calculus is finding the area under a curve8 (more specifically, the area between the graph of a function and the x -axis.)9 In this section, we explore how summation notation is used to help better formulate this problem, and, as with our study of Geometric Series, sneak a peak into Calculus itself.

Suppose we wish to determine the area between the graph of a continuous function y = f ( x ) over the interval [ a , b ] and the x -axis as shown below on the left. Since we don't know any area formulas for arbitrary regions, we stick to what we know - rectangles.

To keep things simple, we divide [ a , b ] into n equal pieces (subintervals), and use the right-endpoints of each piece to determine the height of the rectangles.10 We let x k represent the right endpoint of the k th subinterval, so the height of the k th rectangle is f ( x k ) .

The width of the k th rectangle is the length of the k th subinterval. Since the interval itself is b a units long and we are dividing the interval into n equal pieces, each piece is b a n units long. For brevity, we'll call this length ` Δ x .' Below on the right is a depiction of R S  7 , a `right endpoint sum' using 7 (equally spaced) subintervals.11

Figure: Area under the graph of
Figure 10.7 Area under the graph of y = f ( x )
Figure: Visualizing , a `right endpoint sum.'
Figure 10.8 Visualizing R S  7 , a `right endpoint sum.'

The idea here is to approximate the area of the shaded region by the sum of the areas of the rectangles. In symbols:

Area f ( x 1 ) Δ x + f ( x 2 ) Δ x + f ( x 3 ) Δ x + + f ( x 7 ) Δ x = k = 1 7 f ( x k ) Δ x

Our ultimate goal is to find a formula for the area approximation as described above as a function of the number of rectangles n and look to see what happens as n .

We first note that the right endpoints x k , are terms in an arithmetic sequence: the first right endpoint, x 1 is Δ x to the right of a = x 0 , so x 1 = x 0 + Δ x ; the second right endpoint, x 2 is Δ x units to the right of x 1 , so x 2 = x 1 + Δ x ; the third right endpoint x 3 = x 2 + Δ x and so on. In general, x k = x k 1 + Δ x , proving the x k are terms of an arithmetic sequence with common difference d = Δ x . It follows that x k , the k th right endpoint is k Δ x units to the right of x 0 = a , so that x k = a + k Δ x . We summarize the notation and formulas for right endpoint sums below.

Summary of Formulas for Right Endpoint Sums, R S n

  • Number of rectangles: n
  • Width of each rectangle: Δ x = b a n
  • Right endpoint: x k = a + k Δ x
  • Height of k th rectangle: f ( x k )
  • Area R S n = the sum of the area of the rectangles = k = 1 n f ( x k ) Δ x k

Below we summarize some common summation formulas we'll need when actually computing these sums. Formal proofs of these require the machinery of Section 10.3 and are found there.

Summation Formulas

  • k = 1 n c = c n
  • k = 1 n k = n ( n + 1 ) 2
  • k = 1 n k 2 = n ( n + 1 ) ( 2 n + 1 ) 6
  • k = 1 n k 3 = n 2 ( n + 1 ) 2 4

It is high time for an example.

It is worth noting that, as with other examples in the text, Example 10.2.6 is more or less lifted straight out of a Calculus lecture. That being said, the vast majority of the mechanics here involve precalculus notions.13 In general, the machinations in Calculus amount to applying the limit concept to the mechanics of precalculus.

Exercises

In Exercises -, find the value of each sum using Definition 10.4.

  1. g = 4 9 ( 5 g + 3 )
  2. k = 3 8 1 k
  3. j = 0 5 2 j
  4. k = 0 2 ( 3 k 5 ) x k
  5. i = 1 4 1 4 ( i 2 + 1 )
  6. n = 1 100 ( 1 ) n
  7. n = 1 5 ( n + 1 ) ! n !
  8. j = 1 3 5 ! j ! ( 5 j ) !

In Exercises -, rewrite the sum using summation notation.

  1. 8 + 11 + 14 + 17 + 20
  2. 1 2 + 3 4 + 5 6 + 7 8
  3. x x 3 3 + x 5 5 x 7 7
  4. 1 + 2 + 4 + + 2 29
  5. 2 + 3 2 + 4 3 + 5 4 + 6 5
  6. ln ( 3 ) + ln ( 4 ) ln ( 5 ) + + ln ( 20 )
  7. 1 1 4 + 1 9 1 16 + 1 25 1 36
  8. 1 2 ( x 5 ) + 1 4 ( x 5 ) 2 + 1 6 ( x 5 ) 3 + 1 8 ( x 5 ) 4

In Exercises -, use the formulas in Equation 10.2 to find the sum.

  1. n = 1 10 5 n + 3
  2. n = 1 20 2 n 1
  3. k = 0 15 3 k
  4. n = 1 10 ( 1 2 ) n
  5. n = 1 5 ( 3 2 ) n
  6. k = 0 5 2 ( 1 4 ) k
  7. 1 + 4 + 7 + + 295
  8. 4 + 2 + 0 2 146
  9. 1 + 3 + 9 + + 2187
  10. 1 2 + 1 4 + 1 8 + + 1 256
  11. 3 3 2 + 3 4 3 8 + + 3 256
  12. n = 1 10 2 n + ( 5 3 ) n

In Exercises -, use Theorem 10.5 to find the sum of the given geometric series.14

  1. n = 1 ( 1 2 ) n 1
  2. n = 0 ( 1 ) n  3 n 1 4 n
  3. m = 2 3 2 m 1
  4. k = 0 x k , | x | < 1 .

In Exercises -, use Theorem 10.5 to express each repeating decimal as a fraction of integers.

  1. 0 . 7 ¯
  2. 0 . 13 ¯
  3. 10 . 159 ¯
  4. 5.8 67 ¯

In Exercises -, use Equation 10.3 to compute the future value of the annuity with the given terms. In all cases, assume the payment is made monthly, the interest rate given is the annual rate, and interest is compounded monthly.

  1. payments are $300, interest rate is 2.5%, term is 17 years.
  2. payments are $50, interest rate is 1.0%, term is 30 years.
  3. payments are $100, interest rate is 2.0%, term is 20 years
  4. payments are $100, interest rate is 2.0%, term is 25 years
  5. payments are $100, interest rate is 2.0%, term is 30 years
  6. payments are $100, interest rate is 2.0%, term is 35 years
  7. Suppose an ordinary annuity offers an annual interest rate of 2 % , compounded monthly, for 30 years. What should the monthly payment be to have $ 100 , 000 at the end of the term?
  8. In this exercise, we Theorem 10.5 to represent f ( x ) = 1 x 2 + 4 as a series.

    1. Show that f ( x ) = 1 4 1 ( x 2 4 ) .
    2. Use the formula in Theorem 10.5: a 1 r = k = 1 a r k 1 to write f ( x ) as an infinite series.
    3. Graph y = f ( x ) along with some partial sums of the series. What do you notice?
  9. Using Example 10.2.6 as a guide, find and simplify formula for the right endpoint sum, R S n , for each of the functions below on the specified interval. Find lim n R S n to find the area between the graph of f and the x -axis.

    1. f ( x ) = 4 x over the interval [ 0 , 4 ] .
    2. f ( x ) = 3 x 2 over the interval [ 1 , 3 ] .
    3. f ( x ) = 12 x x 2 over the interval [ 0 , 3 ] .
  10. Prove the properties listed in Theorem 10.4.
  11. Show that the formula for the future value of an annuity due is

    A = P ( 1 + i ) [ ( 1 + i ) n t 1 i ]

  12. Discuss with your classmates what goes wrong when trying to find the following sums.15

    1. k = 1 2 k 1
    2. k = 1 ( 1.0001 ) k 1
    3. k = 1 ( 1 ) k 1
  13. In this exercise, we walk through the proof of Cauchy's Bound, Theorem 2.10 in Section 2.3.

    Let f ( x ) = a n x n + a n 1 x n 1 + + a 1 x + a 0 be a polynomial of degree n and let Z be the largest zero of f in absolute value and let M be the largest of the numbers: | a 0 | | a n | , | a 1 | | a n | , …, | a n 1 | | a n | .

    1. Since P ( Z ) = 0 , solve for Z n : Z n = a n 1 a n Z n 1 + + a 1 a n Z + a 0 a n .
    2. If 1 Z 1 , then Cauchy's Bound is immediately satisfied since Z would automatically lie in the interval [ ( M + 1 ) , M + 1 ] . So we assume | Z | > 1 .

      Under the assumption | Z | > 1 . explain why16

      | Z | n = | a n 1 a n Z n 1 + + a 1 a n Z + a 0 a n | | a n 1 | | a n | | Z | n 1 + + | a 1 | | a n | | Z | + | a 0 | | a n |

    3. Use the definition of M along with the Geometric Sum Formula, Equation 10.2 to show:

      | Z | n M ( | Z | n 1 + + | Z | + 1 ) = M 1 | Z | n 1 | Z | = M | Z | n 1 | Z | 1

    4. Now use the fact that | Z | > 1 to rearrange the above inequality to get:

      | Z | 1 M | Z | n 1 | Z | n = M ( 1 1 | Z | n )

    5. Use the fact that 1 1 | Z | n < 1 to get:

      | Z | 1 M ( 1 1 | Z | n ) < M ( 1 ) = M

    6. From | Z | 1 < M , we get | Z | < M + 1 . Hence, Z lies in the interval [ ( M + 1 ) , M + 1 ] .

Answers

  1. 213
  2. 341 280
  3. 63
  4. 5 2 x + x 2
  5. 17 2
  6. 0
  7. 20
  8. 25
  9. k = 1 5 ( 3 k + 5 )
  10. k = 1 8 ( 1 ) k 1 k
  11. k = 1 4 ( 1 ) k 1 x 2 k 1 2 k 1
  12. k = 1 30 2 k 1
  13. k = 1 5 k + 1 k
  14. k = 3 20 ( 1 ) k ln ( k )
  15. k = 1 6 ( 1 ) k 1 k 2
  16. k = 1 4 1 2 k ( x 5 ) k
  17. 305
  18. 400
  19. 72
  20. 1023 1024
  21. 633 32
  22. 1365 512
  23. 14652
  24. 5396
  25. 3280
  26. 255 256
  27. 513 256
  28. 17771050 59049
  29. n = 1 ( 1 2 ) n 1 = 2
  30. n = 0 ( 1 ) n  3 n 1 4 n = 4 21
  31. m = 2 3 2 m 1 = 3
  32. k = 0 x k = 1 1 x
  33. 7 9
  34. 13 99
  35. 3383 333
  36. 5809 990
  37. $76,163.67
  38. $ 20 , 981.40
  39. $ 29 , 479.69
  40. $ 38 , 882.12
  41. 49 , 272.55
  42. 60 , 754.80
  43. For $ 100 , 000 , the monthly payment is $ 202.95 .
    1. f ( x ) = 1 4 1 ( x 2 4 ) = k = 1 1 4 ( x 2 4 ) k 1 = k = 1 ( 1 ) k 1 x 2 k 2 4 k
    2. No matter how many terms are added, the graph of the series seems to only account for a portion of the graph of y = f ( x ) . This is due to the fact that geometric series converge only when the ratio | r | < 1 . In this case, r = x 2 4 so | r | < 1 corresponds to the interval ( 2 , 2 ) .
  44. Using Example 10.2.6 as a guide, find the area between the graph of each function below and the x -axis by evaluating the limit of a right endpoint sum.

    1. R S n = 8 8 n ; Area is 8 units 2
    2. R S n = 26 + 24 n + 4 n 2 ; Area is 26 units 2
    3. R S n = 45 2 18 n 9 2 n 2 ; Area is 45 2 units 2

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.