7.2: Summation Notation
( \newcommand{\kernel}{\mathrm{null}\,}\)
- Understand and use summation notation.
- Manipulate sums using properties of summation notation.
- Compute the values of arithmetic and geometric summations.
- Use summations within applications.
- Understand series, specifically geometric series, and determine when a geometric series is convergent or divergent.
Introduction to Summation Notation
In the previous section, we introduced sequences. Now, we shall present notation and theorems concerning the sum of terms of a sequence. We begin with a definition, which, while intimidating, is meant to make our lives easier.
Given a sequence {an}∞n=k and numbers m and p satisfying k≤m≤p, the summation from m to p of the sequence {an} is writtenp∑n=man=am+am+1+…+ap.The variable n is called the index of summation. The number m is called the lower limit of summation while the number p is called the upper limit of summation.
In English, the definition of summation notation is simply defining a shorthand notation for adding up the terms of the sequence {an}∞n=k from am through ap. The symbol Σ is the capital Greek letter sigma and is shorthand for "sum." The lower and upper limits of the summation tell us which term to start with and which term to end with, respectively. For example, using the sequence an=2n−1 for n≥1, we can write the sum a3+a4+a5+a6 as6∑n=3(2n−1)=(2(3)−1)+(2(4)−1)+(2(5)−1)+(2(6)−1)=5+7+9+11=32The 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,6∑n=3(2n−1)=6∑k=3(2k−1)=6∑j=3(2j−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 formf(x)=n∑k=0akxkfor real numbers ak, k=0,1,…n. The reader is invited to compare this with what is given in the definition of a polynomial function in Section 3.1.
Our next example gives us practice with this new notation.
- Find the following sums.
- 4∑k=113100k
- 4∑n=0n!2
- 5∑n=1(−1)n+1n(x−1)n
- Write the following sums using summation notation.
- 1+3+5+…+117
- 1−12+13−14+…+1117
- 0.9+0.09+0.009+…0.0⋯0⏟n−1 zeros9
- Solutions
-
-
- We substitute k=1 into the formula 13100k and add successive terms until we reach k=4.4∑k=113100k=131001+131002+131003+131004=0.13+0.0013+0.000013+0.00000013=0.13131313
- Proceeding as in (i), we replace every occurrence of n with the values 0 through 4. We recall the factorials, n! as defined in number Example 7.1.1, number 6 and get:4∑n=0n!2=0!2+1!2+2!2+3!2+4!2=12+12+2⋅12+3⋅2⋅12+4⋅3⋅2⋅12=12+12+1+3+12=17
- We proceed as before, replacing the index n, but not the variable x, with the values 1 through 5 and adding the resulting terms.5∑n=1(−1)n+1n(x−1)n=(−1)1+11(x−1)1+(−1)2+12(x−1)2+(−1)3+13(x−1)3=+(−1)1+44(x−1)4+(−1)1+55(x−1)5=(x−1)−(x−1)22+(x−1)33−(x−1)44+(x−1)55
- The key to writing these sums with summation notation is to find the pattern of the terms. To that end, we use the techniques presented in Section 7.1.
- The terms of the sum 1, 3, 5, etc., form an arithmetic sequence with first term a=1 and common difference d=2. We get the formula for the nth term of the sequence an=1+(n−1)2=2n−1, n≥1. At this stage, we have the formula for the terms, namely 2n−1, and the lower limit of the summation, n=1. To finish the problem, we need to determine the upper limit of the summation. In other words, we must determine which value of n produces the term 117. Setting an=117, we get 2n−1=117 or n=59. Our final answer is1+3+5+…+117=59∑n=1(2n−1)
- We rewrite all of the terms as fractions, the subtraction as addition, and associate the negatives "−" with the numerators to get11+−12+13+−14+…+1117The numerators, 1, −1, etc. can be described by the geometric sequence1 cn=(−1)n−1 for n≥1, while the denominators are given by the arithmetic sequence2 dn=n for n≥1. Hence, we get the formula an=(−1)n−1n for our terms, and we find the lower and upper limits of summation to be n=1 and n=117, respectively. Thus1−12+13−14+−…+1117=117∑n=1(−1)n−1n
- Thanks to Example 7.1.3, we know that one formula for the nth term is an=910n for n≥1. This gives us a formula for the summation and a lower limit of summation. To determine the upper limit of summation, we note that to produce the n−1 zeros to the right of the decimal point before the 9, we need a denominator of 10n. Hence, n is the upper limit of summation. Since n is used in the limits of the summation, we need to choose a different letter for the index of summation.3 We choose k and get0.9+0.09+0.009+…0.0⋯0⏟n−1 zeros 9=n∑k=1910k
-
Properties of Summation Notation
The following theorem presents some general properties of summation notation. While we do not need these properties in Algebra, they play a great role in Calculus. Moreover, there is much to be learned by considering why the properties hold. We invite the reader to prove these results. To get started, remember, "When in doubt, write it out!"
Suppose {an} and {bn} are sequences so that the following sums are defined.
- p∑n=m(an±bn)=p∑n=man±p∑n=mbn
- p∑n=mcan=cp∑n=man, for any real number c.
- p∑n=man=j∑n=man+p∑n=j+1an, for any natural number m≤j<j+1≤p.
- p∑n=man=p+r∑n=m+ran−r, for any whole number r.
- Proof of p∑n=m(an+bn)=p∑n=man+p∑n=mbn
- p∑n=m(an+bn)=(am+bm)+(am+1+bm+1)+⋯+(ap−1+bp−1)+(ap+bp)(Definition of Summation Notation)=(am+am+1+⋯+ap−1+ap)+(bm+bm+1+⋯+bp−1+bp)(Commutative and Associative Properties of Addition)=p∑n=man+p∑n=mbn(Definition of Summation Notation)
Summations of Arithmetic and Geometric Sequences
We now focus on the sums involving arithmetic and geometric sequences. Given an arithmetic sequence ak=a+(k−1)d for k≥1, we let Sn denote the sum of the first n terms. To derive a formula for Sn, we write it out in two different waysSn=a+(a+d)+…+(a+(n−2)d)+(a+(n−1)d)Sn=(a+(n−1)d)+(a+(n−2)d)+…+(a+d)+aIf we add these two equations and combine the terms which are aligned vertically, we get2Sn=(2a+(n−1)d)+(2a+(n−1)d)+…+(2a+(n−1)d)+(2a+(n−1)d)The right-hand side of this equation contains n terms, all of which are equal to (2a+(n−1)d) so we get 2Sn=n(2a+(n−1)d). Dividing both sides of this equation by 2, we obtain the formulaSn=n2(2a+(n−1)d)If we rewrite the quantity 2a+(n−1)d as a+(a+(n−1)d)=a1+an, we get the formulaSn=n(a1+an2)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 nth terms.
To derive the formula for the geometric sum, we start with a geometric sequence ak=ark−1, k≥1, and let Sn once again denote the sum of the first n terms. Comparing Sn and rSn, we getSn=a+ar+ar2+…+arn−2+arn−1rSn=ar+ar2+…+arn−2+arn−1+arnSubtracting the second equation from the first forces all of the terms except a and arn to cancel out and we get Sn−rSn=a−arn. Factoring, we get Sn(1−r)=a(1−rn). Assuming r≠1, we can divide both sides by the quantity (1−r) to obtainSn=a(1−rn1−r)If we distribute a through the numerator, we get a−arn=a1−an+1 which yields the formulaSn=a1−an+11−rIn the case when r=1, we get the formulaSn=a+a+…+a⏟n times=naOur results are summarized below.
- The sum Sn of the first n terms of an arithmetic sequence ak=a+(k−1)d for k≥1 isSn=n∑k=1ak=n(a1+an2)=n2(2a+(n−1)d)
- The sum Sn of the first n terms of a geometric sequence ak=ark−1 for k≥1 isSn={n∑k=1ak=a1−an+11−r=a(1−rn1−r), if r≠1n∑k=1ak=∑nk=1a=na, if r=1
While we have made an honest effort to derive the formulas in this theorem, formal proofs require the machinery in Section 7.3.
- Find the value of the sum.−7−92−2+12+3+⋯+108
- Compute5∑n=17(−23)n−1
- Solutions
-
- We can see that the first term of this summation (and, hence, the first term of the corresponding sequence) is a1=−7. To guarantee we can find the value of this summation,4 we must determine if the underlying sequence is an arithmetic or geometric sequence. Writing out the terms so we can see what's going on, we build the following table:kak1−72−923−241253⋮⋮?108A quick computation shows that a2−a1=a3−a2=a4−a3=a5−a4=52. Therefore, we hope that this pattern continues and that this sequence is arithmetic with common difference d=52 and initial value a1=−7. We now turn to our most recent theorem to compute the value of this summation.Sn=n(−7+1082)=1012n.Our current issue is that we need to find n. Luckily, we have a formula for the sequence. We just need to find n so that108=−7+52(n−1).Solving this equation for n (you should do this), we get n=47. Therefore, the sum of these 47 terms is−7−92−2+12+3+⋯+108=1012⋅47=2373.5.
- The sequence that this summation is built upon isan=7(−23)n−1.This is definitely geometric with a=7 and common ratio r=−23. Thus, 5∑n=17(−23)n−1=7⋅1−(−23)51−(−23)=7⋅1+25351+23=7⋅35+2535+2⋅34=1925405=38581.
Applications of Summations
One way to stack wood for the winter (if you have a wood-burning stove) is to dry stack the wood so that each layer contains one fewer log than the layer below. If I dry stack wood so that the bottom layer has 40 logs and the top layer ends with 18 logs, how long can I keep my house warm considering that I burn one log per hour?
- Solution
-
This is a very common application of arithmetic summations. We have the following sum:40+39+38+⋯+18Therefore, the initial term of our sequence this summation is based on is a1=40. The common difference (how we get to each successive term) is d=−1. Finally, there are n=40−18+1=23 layers of wood (why did we add the 1?). Thus, we haveSn=na1+an2=2340+182=(23)(29)=667pieces of wood. That's 667 hours of heat (or almost 28 days of warmth).
An application of the arithmetic sum formula, which proves useful in Calculus, results in a formula for the sum of the first n natural numbers. The natural numbers themselves are a sequence5 1,2,3,… which is arithmetic with a=d=1. Applying the Sums of Arithmetic and Geometric Sequences theorem,1+2+3+…+n=n(n+1)2So, for example, the sum of the first 100 natural numbers6 is 100(101)2=5050.
This, and some related formulas, is so important that we need to make a theorem out of it.
n∑k=1k=n(n+1)2n∑k=1k2=n(n+1)(2n+1)6n∑k=1k3=n2(n+1)24
The proofs of these will have to wait until we cover Mathematical Induction.
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 6.5 in that payments are deposited into the account on an ongoing basis, which complicates the mathematics a little.7 Suppose you have an account with annual interest rate r which is compounded n times per year. We let i=rn denote the interest rate per period. Suppose we wish to make ongoing deposits of P dollars at the end of each compounding period. Let Ak denote the amount in the account after k compounding periods. Then A1=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 A1 so that our initial investment has grown to A1(1+i)=P(1+i) per the Simple Interest formula. When we add our second payment at the end of the second period, we getA2=A1(1+i)+P=P(1+i)+P=P(1+i)(1+11+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 A2 which then grows to A2(1+i). We add our third payment at the end of the third compounding period to obtainA3=A2(1+i)+P=P(1+i)(1+11+i)(1+i)+P=P(1+i)2(1+11+i+1(1+i)2)During the fourth compounding period, A3 grows to A3(1+i), and when we add the fourth payment, we factor out P(1+i)3 to getA4=P(1+i)3(1+11+i+1(1+i)2+1(1+i)3)This pattern continues so that at the end of the kth compounding, we getAk=P(1+i)k−1(1+11+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=11+i. Using the Sums of Arithmetic and Geometric Sequences theorem, we get1+11+i+1(1+i)2+…+1(1+i)k−1=1(1−1(1+i)k1−11+i)= (1+i)(1−(1+i)−k)iHence, we getAk=P(1+i)k−1((1+i)(1−(1+i)−k)i)=P((1+i)k−1)iIf we let t be the number of years this investment strategy is followed, then k=nt, and we get the formula for the future value of an ordinary annuity.
Suppose an annuity offers an annual interest rate r compounded n times per year. Let i=rn be the interest rate per compounding period. If a deposit P is made at the end of each compounding period, the amount A in the account after t years is given byA=P((1+i)nt−1)i
The reader is encouraged to substitute i=rn into the formula for the future value of an ordinary annuity and simplify. Some familiar equations arise that cause pause and meditation.
One last note: if the deposit P is made at 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 as an exercise for the reader.
An ordinary annuity offers a 6% annual interest rate, compounded monthly.
- If monthly payments of $50 are made, find the value of the annuity in 30 years.
- How many years will it take for the annuity to grow to $100,000?
- Solutions
-
- We have r=0.06 and n=12 so that i=rn=0.0612=0.005. With P=50 and t=30,A=50((1+0.005)(12)(30)−1)0.005≈50225.75Our final answer is $50,225.75.
- To find how long it will take for the annuity to grow to $100,000, we set A=100000 and solve for t. We isolate the exponential and take natural logs of both sides of the equation.100000=50((1+0.005)12t−1)0.00510=(1.005)12t−1(1.005)12t=11ln((1.005)12t)=ln(11)12tln(1.005)=ln(11)t=ln(11)12ln(1.005)≈40.06This means that it takes just over 40 years for the investment to grow to $100,000. Comparing this with our answer to part a, we see that in just 10 additional years, the value of the annuity nearly doubles. This is a lesson worth remembering.
Series
We close this section with a peek into Calculus by considering infinite sums, called series. Consider the number 0.¯9. We can write this number as0.¯9=0.9999...=0.9+0.09+0.009+0.0009+…From Example 7.2.1, we know we can write the sum of the first n of these terms as0.9⋯9⏟n nines =.9+0.09+0.009+…0.0⋯0⏟n−1 zeros 9=n∑k=1910kUsing the Sums of Arithmetic and Geometric Sequences theorem, we haven∑k=1910k=910(1−110n+11−110)=1−110n+1It stands to reason that 0.¯9 is the same value of 1−110n+1 as n→∞. Our knowledge of exponential expressions from Section 6.1 tells us that 110n+1→0 as n→∞, so 1−110n+1→1. We have just argued that 0.¯9=1, which may cause some distress for some readers.8 Any non-terminating decimal can be thought of as an infinite sum whose denominators are the powers of 10. Hence, adding up infinitely many terms and arriving at a finite number is not as foreign of a concept as it may appear. We end this section with a theorem concerning geometric series.
Given the sequence ak=ark−1 for k≥1, where |r|<1,a+ar+ar2+…=∞∑k=1ark−1=a1−rIf |r|≥1, the sum a+ar+ar2+… is not defined.
The justification of the result in this theorem comes from taking the formula in Sums of Arithmetic and Geometric Sequences theorem for the sum of the first n terms of a geometric sequence and examining the formula as n→∞. Assuming |r|<1 means −1<r<1, so rn→0 as n→∞. Hence as n→∞,n∑k=1ark−1=a(1−rn1−r)→a1−rAs to what goes wrong when |r|≥1, we leave that to Calculus as well, but will explore some cases in the exercises. Before we jump into exercises, it's in our best interest to introduce a little bit of mathematical language that is used frequently in Calculus.
The geometric series∞∑k=1ark−1is called convergent if |r|<1 and, in such a case, it is said to converge to a1−r. If |r|≥1, the series is said to be divergent.
The formula for a convergent geometric series∞∑k=1ark−1=a1−r,only works if |r|<1. Moreover, because series will often be given to you with a lower limit not equal to 1 or with exponents not equal to k−1, it is crucial to rephrase the required "structure" of the geometric series form. Essentially, you want to manipulate your given series (through factoring) to the formb∑rp,where the power, p, is 0 when evaluated at the lower limit of the summation.
That "Cautionary" statement needs some clarification, so let's see it in an example.
Determine if the series converges or diverges. If it is convergent, find its value.
- ∞∑n=03(2)n+1(−5)n+3
- 32−154+758−37516+⋯
- Solutions
-
- Note that the sequence being summed, 3(2)n+1(−5)n+3, is fairly complex. Moreover, the lower limit of the summation is not 1 as seems to be required by the Sums of Geometric Series theorem. However, fear not! The "Cautionary" statement asserts that, as long as the first power of our summation is 0, we should be fine.
Unfortunately, when we get the first term of the expansion, ∞∑n=03(2)n+1(−5)n+3=3⋅21(−5)3+⋯,we can see that those exponents are not 0 and they don't even match each other! What do we do?
A little algebra goes a long way here.∞∑n=03(2)n+1(−5)n+3=3∞∑n=0(2)n+1(−5)n+3=3(21(−5)3)∞∑n=0(2)n(−5)n=−6125∞∑n=0(−25)nWe now have our series in a form where the exponent of the first term of the expansion will be 0 (try it out and see!). Moreover, we can see that |r|=|−25|=25<1. Therefore, this series converges. Specifically,∞∑n=03(2)n+1(−5)n+3=−6125∞∑n=0(−25)n=−6125⋅11−(−25)=−6125⋅11+25=−6125⋅55+2=−6125⋅57=−625⋅17=−6175 - Rewriting this summation in series form, we get∞∑k=032(−52)n.Note that I used the lower index of k=0 here to reinforce the point that you don't need your lower index to always start at 1 as long as your first power in your expansion has an exponent of 0 on r=−52. Speaking of which, since |r|=|−52|=52≥1, this geometric series is divergent.
- Note that the sequence being summed, 3(2)n+1(−5)n+3, is fairly complex. Moreover, the lower limit of the summation is not 1 as seems to be required by the Sums of Geometric Series theorem. However, fear not! The "Cautionary" statement asserts that, as long as the first power of our summation is 0, we should be fine.
A common starting discussion in Calculus about limits concerns walking "half-distances." Suppose you are playing a game, and the goal is to move your game piece so it eventually touches the board's edge. The rules of the game are that you can always move in any direction, but you must move at most a distance that is half the current distance between your game piece and the edge. How can you win?
- Solution
-
You can't.
Okay, we need more discussion than that. Suppose you take the most direct route to the edge. On your first turn, you must halve the distance from the current position to the edge. On your second turn, you move half the remaining distance. You repeat this process ad infinitum.
You can compute the total distance traveled using a series. Let D be the initial distance the piece is from the edge of the board, and let i be the number of the turn.
So, on turn i=1, you move your piece a total of 12D directly toward the edge of the board.
On your second turn, you move half of the remaining distance. Since the remaining distance is 12D, you move 12(12D)=122D.9
On the third turn, you move half of the remaining distance. Let's see, you have moved 12D+14D=34D. Therefore, the remaining distance is 14D. So you move your piece 12(14D)=123D.
The fourth turn comes, and you see a pattern. To check, let's do one last computation. You have already moved your piece 12D+14D+18D=78D. So you only have 18D to go. You move your piece half this distance, 12(18D)=124D, toward the edge.
This pattern continues on and on.
Building a table of our "step sizes," we getiSi112D2122D3123D4124D⋮⋮Summing the sequence Si in the table, we getTotal distance moved =∞∑i=112iD=∞∑i=1D(12)i.At this point, we have the common ratio, r=12, and what looks to be the value of a (it looks like a=D); however, there is a problem. The form of this series does not match the form in the Sums of Geometric Series theorem. We need the exponent on the common ratio, r=12, to be i−1. The easiest way to reduce the power of an expression is to factor off one power. That is, 12i=12(12i−1). Hence, our series becomesTotal distance moved =∞∑i=112iD=∞∑i=1D2⋅12i−1=∞∑i=1D2(12)i−1=D/21−12=D2−1=D.Thus, given an infinite amount of turns, we will have moved the game piece a total distance of D (which is the full length of the initial distance the piece was from the edge of the board); however, we cannot have an infinite number of moves! Moreover, pretending that we had 10100 turns,10 we would still have half of a remaining distance before the piece would reach the true edge.
Hence, despite theoretically being able to move the piece the full distance D to the edge of the board, the moment we believe we have reached the edge of the board would be on some finite turn, say the nth turn, and at that moment, we would still have a sliver of space left between the game piece and the edge - and we can only move half that remaining distance.
Footnotes
1 This is indeed a geometric sequence with first term a=1 and common ratio r=−1.
2 It is an arithmetic sequence with first term a=1 and common difference d=1.
3 To see why, try writing the summation using "n" as the index.
4 This is a summation. It's just that we are adding negative values for the first few terms.
5 This is the identity function on the natural numbers!
6 There is an interesting anecdote which says that the famous mathematician Carl Friedrich Gauss was given this problem in primary school and devised a very clever solution.
7 The reader may wish to re-read the discussion on compound interest in Section 6.5 before proceeding
8 To make this more palatable, it is usually accepted that 0.¯3=13 so that 0.¯9=3(0.¯3)=3(13)=1. Feel better?
9 It is a great idea when dealing with sequences, summations, and series to not simplify expressions. This allows you to see the patterns within sums.
10 You should Google this number. The namesake is very familiar to you!