In short
Sigma notation \displaystyle\sum_{k=1}^{n} a_k is shorthand for a_1 + a_2 + \dots + a_n. Pi notation \displaystyle\prod_{k=1}^{n} a_k is shorthand for a_1 \cdot a_2 \cdots a_n. Both are controlled by an index variable, a starting value, and an ending value. Sigma notation obeys linearity rules (constants factor out, sums split), and telescoping sums — where consecutive terms cancel — are a powerful technique for evaluating sums in closed form.
Write out the sum of the squares of the first 50 positive integers. In longhand, that is 1^2 + 2^2 + 3^2 + 4^2 + \dots + 50^2 — a string of fifty terms connected by plus signs. Now imagine writing the sum of the first 500 terms, or a sum where the general term is a complicated expression like \frac{k^2}{(k+1)(k+2)}. Longhand becomes unreadable. You need a notation that says "add up these terms" without listing every one.
That notation is \Sigma (the Greek capital letter sigma, for "sum"). Instead of fifty terms separated by plus signs, you write:
Five symbols replace fifty terms. The notation tells you three things: the index variable (k), where it starts (k = 1), and where it ends (k = 50). The expression after the sigma (k^2) is the general term — the formula that produces each term when you plug in successive values of k.
There is an analogous notation for products: \Pi (the Greek capital letter pi, for "product"). Where sigma adds, pi multiplies. The factorial n! = 1 \times 2 \times 3 \times \dots \times n is simply:
This article explains how to read, write, and manipulate both notations, and introduces telescoping sums — a technique that collapses certain sums into just two terms.
Summation notation — the rules
Reading sigma notation
To evaluate \displaystyle\sum_{k=1}^{4} (2k + 1):
- Set k = 1: the term is 2(1) + 1 = 3.
- Set k = 2: the term is 2(2) + 1 = 5.
- Set k = 3: the term is 2(3) + 1 = 7.
- Set k = 4: the term is 2(4) + 1 = 9.
- Add them: 3 + 5 + 7 + 9 = 24.
The index variable is a dummy variable — it does not matter whether you call it k, i, j, or m. The expressions \sum_{k=1}^{n} k^2 and \sum_{j=1}^{n} j^2 mean exactly the same thing.
Writing sigma notation
To express a sum in sigma notation, identify the pattern in the terms and write the general term as a formula involving the index.
The sum \frac{1}{1 \cdot 2} + \frac{1}{2 \cdot 3} + \frac{1}{3 \cdot 4} + \dots + \frac{1}{99 \cdot 100} has general term \frac{1}{k(k+1)}, with k running from 1 to 99:
Properties of sigma notation
Sigma notation obeys several rules that make manipulation easier. These are not arbitrary conventions — they follow directly from the properties of addition.
Properties of Summation
For sequences a_k and b_k, a constant c, and integers 1 \leq m \leq n:
1. Constant multiple rule:
2. Sum/difference rule:
3. Sum of a constant:
4. Splitting a range:
These properties are the reason sigma notation is powerful: you can break a complicated sum into simpler pieces, factor out constants, and recombine. The rules are analogous to how you handle integrals — \int [f + g] = \int f + \int g — and this is no coincidence, since integration is the continuous analogue of summation.
Example of the rules in action. Evaluate \sum_{k=1}^{n} (3k^2 + 2k - 5):
Each piece is a known formula. The sigma properties turned one complicated sum into three standard ones.
Product notation
Pi notation does for multiplication what sigma does for addition. The expression \displaystyle\prod_{k=1}^{n} a_k means a_1 \cdot a_2 \cdot a_3 \cdots a_n.
Examples.
That last product telescopes — most factors cancel, leaving \frac{6}{1} = 6. Telescoping in products works the same way as telescoping in sums: consecutive terms cancel.
Properties of pi notation.
These follow from the commutativity and associativity of multiplication, just as the sigma rules follow from addition properties.
Telescoping sums
A telescoping sum is one where consecutive terms cancel, leaving only a few surviving terms — usually the first and the last. The name comes from a telescope: the sum collapses like the nested tubes of a collapsible telescope.
The standard telescoping identity
If you can write a_k = f(k) - f(k+1) for some function f, then:
The intermediate terms cancel: f(1) - f(2) + f(2) - f(3) + f(3) - f(4) + \dots + f(n) - f(n+1) = f(1) - f(n+1).
A classic example
Evaluate \sum_{k=1}^{99} \frac{1}{k(k+1)}.
Use partial fractions: \frac{1}{k(k+1)} = \frac{1}{k} - \frac{1}{k+1}.
So:
The sum of 99 fractions collapses to a single fraction. Without the telescoping trick, you would need to find a common denominator for 99 terms — essentially impossible by hand.
Recognising telescoping opportunities
The key step is the partial fraction decomposition (or a similar algebraic rewriting) that expresses the general term as a difference of consecutive values of some function. Common forms:
| General term | Rewrite as | Telescopes to |
|---|---|---|
| \frac{1}{k(k+1)} | \frac{1}{k} - \frac{1}{k+1} | 1 - \frac{1}{n+1} |
| \frac{1}{k(k+2)} | \frac{1}{2}\left(\frac{1}{k} - \frac{1}{k+2}\right) | \frac{1}{2}\left(1 + \frac{1}{2} - \frac{1}{n+1} - \frac{1}{n+2}\right) |
| \frac{2k+1}{k^2(k+1)^2} | \frac{1}{k^2} - \frac{1}{(k+1)^2} | 1 - \frac{1}{(n+1)^2} |
The pattern: whenever the general term is a difference of a function evaluated at consecutive integers, the sum telescopes.
Worked examples
Example 1: Evaluate $\displaystyle\sum_{k=1}^{20} (2k - 1)$ using sigma properties and verify the result
Step 1. Split by linearity.
Why: the sum/difference rule and the constant-multiple rule let you separate the sum into two standard pieces.
Step 2. Evaluate each piece.
Why: \sum k = \frac{n(n+1)}{2} and \sum 1 = n are the two most basic summation formulas.
Step 3. Combine.
Why: subtraction gives the final value.
Step 4. Verify: the sum 1 + 3 + 5 + \dots + 39 is the sum of the first 20 odd numbers. There is a well-known result: the sum of the first n odd numbers is n^2. Indeed, 20^2 = 400. Consistent.
Why: a known identity provides an independent check — if the two answers disagree, you know there is an error somewhere.
Result: \displaystyle\sum_{k=1}^{20} (2k - 1) = 400 = 20^2.
The gnomon picture explains why the sum of odd numbers is a perfect square: each odd number wraps around the previous square to form a slightly larger square. The sigma notation \sum_{k=1}^{20} (2k-1) is the algebraic expression of this geometric fact.
Example 2: Evaluate $\displaystyle\sum_{k=1}^{50} \frac{1}{k(k+1)}$ using telescoping
Step 1. Decompose into partial fractions.
Multiply both sides by k(k+1): 1 = A(k+1) + Bk. Set k = 0: A = 1. Set k = -1: B = -1.
Why: partial fractions rewrites the general term as a difference of consecutive terms — the signature of a telescoping sum.
Step 2. Write out the first few and last few terms.
Why: writing out a few terms lets you see the cancellation pattern before jumping to the answer.
Step 3. Cancel.
Every -\frac{1}{k+1} from one term is killed by the +\frac{1}{k+1} in the next term. Only the very first positive part (\frac{1}{1}) and the very last negative part (-\frac{1}{51}) survive:
Why: this is the telescope collapsing — 50 terms reduce to 2.
Step 4. Interpret.
The sum \frac{1}{1 \cdot 2} + \frac{1}{2 \cdot 3} + \dots + \frac{1}{50 \cdot 51} = \frac{50}{51} \approx 0.9804. As n increases, \sum_{k=1}^{n} \frac{1}{k(k+1)} = \frac{n}{n+1} \to 1. The infinite series converges to 1.
Why: the general formula \frac{n}{n+1} reveals the limiting behaviour — the sum approaches 1 but never reaches it for finite n.
Result: \displaystyle\sum_{k=1}^{50} \frac{1}{k(k+1)} = \frac{50}{51}.
The graph shows the diminishing returns of adding more terms: the first 10 terms get you to \frac{10}{11} \approx 0.91, but the next 40 terms only contribute about 0.07 more. The telescoping formula \frac{n}{n+1} captures this behaviour exactly.
Common confusions
-
"\sum_{k=1}^{n} a_k \cdot b_k = \left(\sum a_k\right)\left(\sum b_k\right)." This is false. The sum of products is not the product of sums. For example, \sum_{k=1}^{2} k \cdot k = 1 + 4 = 5, but \left(\sum_{k=1}^{2} k\right)^2 = 3^2 = 9. Sigma distributes over addition, not over multiplication.
-
"The index variable matters." It does not — \sum_{k=1}^{n} k^2 and \sum_{j=1}^{n} j^2 are the same sum. The index is a dummy variable. However, you should not use the same letter for the index and for a variable that appears elsewhere in the expression.
-
"An empty sum (\sum_{k=1}^{0}) is undefined." By convention, an empty sum (where the upper limit is less than the lower limit) equals 0, and an empty product (\prod_{k=1}^{0}) equals 1. These conventions ensure that formulas remain valid in edge cases — for instance, \sum_{k=1}^{n} k = \frac{n(n+1)}{2} gives 0 when n = 0, which is the correct empty sum.
-
"Telescoping only works with fractions." Telescoping works whenever you can write the general term as f(k) - f(k+1) (or f(k+1) - f(k)). The terms can be polynomials, radicals, or any other expressions. For instance, \sum_{k=1}^{n} (\sqrt{k+1} - \sqrt{k}) telescopes to \sqrt{n+1} - 1.
-
"You can always change the limits freely." Changing the limits of summation changes the sum unless you adjust the general term to compensate. The substitution j = k - 1 in \sum_{k=1}^{n} a_k gives \sum_{j=0}^{n-1} a_{j+1} — you must shift the general term too.
Going deeper
If you came here to learn how sigma and pi notation work, manipulate sums using linearity, and evaluate telescoping sums, you have everything you need. The rest of this section is for readers who want to see more advanced uses and connections.
Index shifts and double sums
An index shift replaces k with k + c (or k - c) throughout the sum, adjusting the limits accordingly. This is the discrete analogue of substitution in integrals. For example:
The shift k \to k + 1 drops the lower limit by 1 and replaces a_k with a_{k+1}.
A double sum has two index variables:
The inner sum runs first (over j), producing a quantity that depends on i, and then the outer sum runs over i. When the limits are independent of each other, you can swap the order of summation: \sum_i \sum_j a_{ij} = \sum_j \sum_i a_{ij}. This is the discrete analogue of Fubini's theorem for double integrals.
Telescoping products
Telescoping works for products too. If a_k = \frac{f(k+1)}{f(k)}, then:
Everything in between cancels. The product \prod_{k=2}^{n} \frac{k}{k-1} = \frac{n}{1} = n is a simple instance. A more interesting example:
The first product telescopes to \frac{1}{n} and the second to \frac{n+1}{2}, giving \frac{n+1}{2n}.
Connection to calculus
Sigma notation is the language of Riemann sums, which define the definite integral. The integral \int_a^b f(x) \, dx is defined as:
where \Delta x = \frac{b-a}{n} and x_k^* is a sample point in the k-th subinterval. Every skill you build with sigma notation — splitting sums, factoring constants, evaluating closed forms — transfers directly to computing integrals from the definition. The notation is not just shorthand; it is the bridge between algebra and calculus.
Where this leads next
- Sequences Introduction — sigma and pi notation describe sums and products of sequences, so understanding sequences is the natural foundation.
- Special Series — the formulas \sum k^2 = \frac{n(n+1)(2n+1)}{6} and \sum k^3 = [\frac{n(n+1)}{2}]^2 are the closed forms that sigma notation points to.
- Sum of Arithmetic Progression — the formula \sum_{k=1}^{n} (a + (k-1)d) = \frac{n}{2}(2a + (n-1)d) is the most important single application of sigma notation in the AP chapter.
- Sum of Geometric Progression — the geometric series \sum_{k=0}^{n} ar^k = a \cdot \frac{1 - r^{n+1}}{1 - r} uses the same sigma language and has its own telescoping-style derivation (multiply by r and subtract).
- Mathematical Induction — many summation identities expressed in sigma notation are proved by induction, and the inductive step typically peels off the last term of the sum.