Lesson 2 of 7 · 15 min

Sigma notation

Read, write and evaluate sums in sigma notation, count their terms, and split off the last term, which is the move every induction proof about a sum depends on.

What you will be able to do

  • Expand and evaluate a sum written in sigma notation.
  • Write a sum in sigma notation by finding a general term and the limits.
  • Count the terms of a sum, and split off its last term: ∑r=1k+1Tr=∑r=1kTr+Tk+1\sum_{r=1}^{k+1} T_r = \sum_{r=1}^{k} T_r + T_{k+1}.

Induction proofs are often about sums with nn terms, like 12+22+32+⋯+n21^2 + 2^2 + 3^2 + \cdots + n^2. Writing "+⋯++ \cdots +" works, but it hides the pattern and gets clumsy quickly. Sigma notation writes the whole sum with one symbol. Σ\Sigma is the Greek capital letter sigma, an S for "sum".

Read it as "the sum of TrT_r from r=1r = 1 to r=nr = n".
∑r=1nTr=T1+T2+T3+⋯+Tn\sum_{r=1}^{n} T_r = T_1 + T_2 + T_3 + \cdots + T_n
The parts of ∑r=15r2\sum_{r=1}^{5} r^2
PartIn ∑r=15r2\sum_{r=1}^{5} r^2Meaning
IndexrrThe counter. It takes every integer value from the lower limit to the upper limit.
Lower limitr=1r = 1The first value of the index.
Upper limit55The last value of the index.
General termr2r^2Substitute each value of the index to get each term.

∑r=15r2\sum_{r=1}^{5} r^2 is the total height of the five bars: 1+4+9+16+25=551 + 4 + 9 + 16 + 25 = 55.

The letter used for the index doesn't matter: ∑i=13xi\sum_{i=1}^{3} x_i and ∑r=13xr\sum_{r=1}^{3} x_r both mean x1+x2+x3x_1 + x_2 + x_3. The limits can be any integers, and they can contain nn. The syllabus example

∑j=02n+12j=20+21+22+⋯+22n+1\sum_{j=0}^{2n+1} 2^j = 2^0 + 2^1 + 2^2 + \cdots + 2^{2n+1}

starts at j=0j = 0 and stops at j=2n+1j = 2n + 1.

Key idea

Counting terms

∑r=abTr\sum_{r=a}^{b} T_r has b−a+1b - a + 1 terms. The +1+1 counts the first term.

So ∑r=310Tr\sum_{r=3}^{10} T_r has 10−3+1=810 - 3 + 1 = 8 terms, and ∑j=02n+12j\sum_{j=0}^{2n+1} 2^j has (2n+1)−0+1=2n+2(2n + 1) - 0 + 1 = 2n + 2 terms.

Interactive

Powers of 2 and their running totals

Each running total is one less than a power of 2. Which power? You will prove the pattern in the next two lessons.

Worked example

Expand and evaluate sums in sigma notation

  • Foundation
  • Technology free

(a) Evaluate ∑r=14r(r+1)\sum_{r=1}^{4} r(r + 1).

(b) Evaluate ∑k=36(−1)kk\sum_{k=3}^{6} (-1)^k k.

(c) How many terms does ∑j=02n+12j\sum_{j=0}^{2n+1} 2^j have? Evaluate it when n=2n = 2.

5 steps

Try it yourself first, then check the working one step at a time.

Method

  1. List the values the index takes, from the lower limit to the upper limit.

  2. Substitute each value into the general term.

  3. Add the terms.

  4. Count terms with (upper limit) −- (lower limit) +1+ 1.

Watch out for

  • Starting at r=1r = 1 when the lower limit is something else.

  • Counting terms as upper limit minus lower limit, forgetting the +1+1.

Evaluate ∑r=25(3r−1)\sum_{r=2}^{5} (3r - 1).

To write a sum in sigma notation, find a general term that produces every term, then find the limits. In 4+7+10+⋯+614 + 7 + 10 + \cdots + 61 the terms go up by 33, so try Tr=3r+1T_r = 3r + 1, which gives 44 when r=1r = 1. The last term needs 3r+1=613r + 1 = 61, so r=20r = 20, and

4+7+10+⋯+61=∑r=120(3r+1).4 + 7 + 10 + \cdots + 61 = \sum_{r=1}^{20} (3r + 1).

Alternating signs come from a power of −1-1: (−1)r+1(-1)^{r+1} is +1,−1,+1,…+1, -1, +1, \ldots for r=1,2,3,…r = 1, 2, 3, \ldots

Worked example

Write a sum in sigma notation

  • Simple familiar
  • Technology free

Write each sum in sigma notation.

(a) 4+7+10+⋯+614 + 7 + 10 + \cdots + 61

(b) 12−14+18−116+132−164\frac{1}{2} - \frac{1}{4} + \frac{1}{8} - \frac{1}{16} + \frac{1}{32} - \frac{1}{64}

5 steps

Try it yourself first, then check the working one step at a time.

Method

  1. Find how the terms change: a constant difference dd suggests Tr=dr+cT_r = dr + c; a constant ratio suggests a power.

  2. Match the first term to the lower limit.

  3. Solve Tr=T_r = (last term) to find the upper limit.

  4. Use (−1)r+1(-1)^{r+1} or (−1)r(-1)^r to alternate signs.

  5. Check by expanding the first and last terms.

Watch out for

  • Using the last term, 6161, as the upper limit instead of the index value that produces it, 2020.

  • Getting the alternating sign the wrong way round: (−1)r(-1)^r makes the first term negative.

Which of these is 1+4+9+16+⋯+4001 + 4 + 9 + 16 + \cdots + 400?

Choose one answer

Key idea

Rules for sigma notation

For a constant cc and any terms TrT_r and UrU_r:

∑r=1nc Tr=c∑r=1nTr,∑r=1n(Tr+Ur)=∑r=1nTr+∑r=1nUr,∑r=1nc=nc.\sum_{r=1}^{n} c\,T_r = c\sum_{r=1}^{n} T_r, \qquad \sum_{r=1}^{n} \left(T_r + U_r\right) = \sum_{r=1}^{n} T_r + \sum_{r=1}^{n} U_r, \qquad \sum_{r=1}^{n} c = nc.

The last rule is nn copies of cc added together.

Key idea

Splitting off the last term

The sum to k+1k + 1 terms is the sum to kk terms plus one more term:

∑r=1k+1Tr=∑r=1kTr+Tk+1.\sum_{r=1}^{k+1} T_r = \sum_{r=1}^{k} T_r + T_{k+1}.

Tk+1T_{k+1} is the general term with rr replaced by k+1k + 1. For example, ∑r=1k+1r2=∑r=1kr2+(k+1)2\sum_{r=1}^{k+1} r^2 = \sum_{r=1}^{k} r^2 + (k + 1)^2. Every induction proof about a sum uses this step.

For ∑r=1nr(2r−1)\sum_{r=1}^{n} r(2r - 1), write down Tk+1T_{k+1}, the (k+1)(k + 1)th term, in terms of kk.

T k+1 =
Reads asYour answer shows here as maths.

Common mistake

Three slips to avoid

  • ∑r=1n3=3n\sum_{r=1}^{n} 3 = 3n, not 33. There are nn terms, each equal to 33.
  • ∑r2\sum r^2 is not (∑r)2\left(\sum r\right)^2. For r=1,2r = 1, 2: 1+4=51 + 4 = 5, but (1+2)2=9(1 + 2)^2 = 9.
  • In Tk+1T_{k+1}, replace the index everywhere, including in powers: the (k+1)(k + 1)th term of ∑2r\sum 2^r is 2k+12^{k+1}.
Gauss's trick for 1+2+3+⋯+n1 + 2 + 3 + \cdots + n

Write the sum forwards and backwards, then add the two lines:

S=1+2+⋯+(n−1)+nS=n+(n−1)+⋯+2+12S=(n+1)+(n+1)+⋯+(n+1)+(n+1)\begin{aligned} S &= 1 + 2 + \cdots + (n - 1) + n \\ S &= n + (n - 1) + \cdots + 2 + 1 \\ 2S &= (n + 1) + (n + 1) + \cdots + (n + 1) + (n + 1) \end{aligned}

There are nn brackets, so 2S=n(n+1)2S = n(n + 1) and

∑r=1nr=n(n+1)2.\sum_{r=1}^{n} r = \frac{n(n+1)}{2}.

A trick like this only works for special sums. In the next lesson you will prove this formula, and others like it, by induction.

Without technology

List the terms and add them, or combine a known result such as ∑r=1nr=n(n+1)2\sum_{r=1}^{n} r = \frac{n(n+1)}{2} with the rules above. In Paper 1, show the terms or the formula you used.

With technology

A CAS calculator has a Σ\Sigma template: enter the general term, the index and the two limits. It is a quick check in Paper 2, and it can evaluate sums with a symbolic upper limit nn.

Summary

  • ∑r=abTr\sum_{r=a}^{b} T_r is the sum of TrT_r as rr runs through the integers from aa to bb.

  • It has b−a+1b - a + 1 terms.

  • To write a sum in sigma notation, find a general term, then the first and last values of the index.

  • Constants factor out, sums split, and ∑r=1nc=nc\sum_{r=1}^{n} c = nc.

  • ∑r=1k+1Tr=∑r=1kTr+Tk+1\sum_{r=1}^{k+1} T_r = \sum_{r=1}^{k} T_r + T_{k+1}, where Tk+1T_{k+1} replaces the index by k+1k + 1 everywhere.

Finished the lesson?

Try the 3 quick checks above and the lesson completes itself, or mark it complete now.

Lesson 2 of 70% read

Save your progress with a free account