Skip to content
Tutorials Center
My learning

Topics

Lesson 34 of 38 · Sequences, Series and the Binomial Theorem

Series and Sigma Notation

Read and write sigma notation, expand and evaluate sums, use rules for sums of constants, k and k squared, and handle shifted index ranges.

Writing 1 + 2 + 3 + ... + 100 is fine, but longer sums need compact notation. Mathematicians use the Greek capital letter sigma, Σ, for "sum". A series is the sum of the terms of a sequence, and sigma notation is the standard way to write it.

Reading sigma notation

Text
Σ (k = 1 to 5) of (2k + 1)  =  (2·1+1) + (2·2+1) + (2·3+1) + (2·4+1) + (2·5+1)
                            =  3 + 5 + 7 + 9 + 11 = 35

Parts of the notation:

  • the index k (a dummy variable that counts),
  • the lower limit (where it starts) and upper limit (where it stops),
  • the summand (the expression, 2k + 1 here).

We will write sums as Σ[k=m..n] f(k).

Example 1. Σ[k=1..4] k²= 1 + 4 + 9 + 16 = 30.

Example 2. Σ[k=0..3] 2^k = 1 + 2 + 4 + 8 = 15.

Example 3. Σ[k=3..6] (k - 1) = 2 + 3 + 4 + 5 = 14 (the index need not start at 1).

Writing a sum in sigma notation. The sum 4 + 7 + 10 + 13 + 16 is arithmetic with a₁ = 4, d = 3, so term k is 3k + 1, running from k = 1 to 5: Σ[k=1..5] (3k + 1). Notation is not unique: Σ[k=0..4] (3k + 4) gives the same sum.

Rules for sums

Sums are linear:

Text
Σ (a·f(k)) = a · Σ f(k)
Σ (f(k) + g(k)) = Σ f(k) + Σ g(k)
Σ[k=1..n] c = n·c

Three formulas are worth remembering:

Text
Σ[k=1..n] k   = n(n + 1)/2
Σ[k=1..n] k²  = n(n + 1)(2n + 1)/6
Σ[k=1..n] k³  = (n(n + 1)/2)²

Example 4. Evaluate Σ[k=1..10] (3k² - 2k + 1):

Text
= 3·Σk² - 2·Σk + Σ1
= 3·385 - 2·55 + 10
= 1155 - 110 + 10 = 1055

(Using Σk² = 10·11·21/6 = 385 and Σk = 55.)

Example 5. Sum of the first 20 odd numbers: Σ[k=1..20] (2k - 1) = 2·210 - 20 = 400 = 20². In fact the sum of the first n odd numbers is always n².

Geometric and arithmetic sums in sigma form

  • Arithmetic: Σ[k=1..n] (a₁ + (k-1)d) = n(a₁ + aₙ)/2.
  • Geometric: Σ[k=0..n-1] a·rᵏ = a(1 - rⁿ)/(1 - r).

An infinite sum Σ[k=0..∞] a·rᵏ equals a/(1 - r) when |r| < 1.

Watch the number of terms. Σ[k=0..n] has n + 1 terms, not n. Count by upper - lower + 1.

Shifting the index

You can re-label the index without changing the sum. If j = k + 1 then Σ[k=0..4] (k + 1) = Σ[j=1..5] j. Each limit moves by the same amount, and the summand is rewritten in terms of the new index.

Compute sums with loops

A Σ is just a for loop that accumulates a total. We compare brute force with the closed forms.

Python Sigma notation as a loop

Press Run (or Ctrl + Enter) to see the result here.

Program input · what you'd type while the program runs

Type the answers before you press Run, one per line. Each time the program reads a line (with input()), it gets the next line from this box.

Symbolic sums

Python Closed forms with SymPy

Press Run (or Ctrl + Enter) to see the result here.

Program input · what you'd type while the program runs

Type the answers before you press Run, one per line. Each time the program reads a line (with input()), it gets the next line from this box.

Check your understanding

Quick check · 4 questions

of 4 answered You scored / 4 · perfect!

  1. 1. What is Σ[k=1..5] (2k + 1)?

    3 + 5 + 7 + 9 + 11 = 35.
  2. 2. How many terms are in Σ[k=0..7] k²?

    Upper minus lower plus one: 7 - 0 + 1 = 8 terms.
  3. 3. What is Σ[k=1..n] k?

    This is Gauss's formula for the sum of the first n positive integers.
  4. 4. What is Σ[k=1..6] 4?

    A constant summed n times gives n·c = 6·4 = 24.

Summary

  • Σ[k=m..n] f(k) adds f(k) for every integer k from m to n; there are n - m + 1 terms.
  • Sums are linear: constants pull out and sums split.
  • Memorize Σk, Σk² and Σk³ for k = 1..n.
  • An infinite geometric sum Σ a·rᵏ equals a/(1 - r) when |r| < 1.

Next: The Binomial Theorem and Pascal's Triangle