Summation notation is used to denote a sum of terms. Usually, the terms follow a pattern or formula.
In this case, 1 and n are the limits of summation and k is the summation variable. Each integer from the lower limit (in this case, 1) to the upper limit (in this case, n), including both limits, is substituted in turn for each occurence of k in the term . After that, the results are added.
You may use any variable for the summation variable, though most often people use the letters from i through n. The lower and upper limits may be any integers, as long as the upper limit is greater than or equal to the lower limit. The term in the sum may be any function of the summation variable; the summation variable may also be used as a subscript of superscript.
In some cases, you can evaluate the sum ("add up the terms"), so I got 55 for the value of the first sum. In other cases, you might leave the sum unevaluated (as in ). What you do depends on the situation. In some cases, you can evaluate the sum using a computer or calculator. For example:
It's often useful to go from a sum of terms written out "the long way" to a summation:
Notice that you can also write
There are infinitely many ways to write a sum using summation notation. It's a good habit to check that you have the correct range for your index by plugging in the top and bottom numbers. For example, using , I find that
These are the first and last terms for the original sum, so I have some assurance that I set it up correctly.
Sometimes you can obtain a formula for a sum. Here are some important formulas.
Proof. Here's a pictorial argument for the first formula:
Try drawing a picture for yourself in the case .
Here's the proof of the first formula by induction. If you're not familiar with induction, it's probably safe to skip this.
For , the left side is 1, and the right side is
This proves the result for .
Assume that the result holds for n:
I'll prove the result for :
This proves the result for , so it holds for all by induction.
The other two formulas can also be proved by induction. I won't give the proofs here.
Example. Evaluate the following sums:
Example. Find a closed-form expression for .
Example. (Telescoping series) You can prove the following identity by combining the fractions on the right over a common denominator:
Use this identity to compute .
I used the given identity to rewrite the sum, then I wrote out enough of the terms that I could see what's happening. All the terms except for the four in the last line cancel: Each term from to appears once with positive sign and once with negative sign. This leaves the four terms in the last line.
Bruce Ikenaga's Home Page
Copyright 2018 by Bruce Ikenaga