Mathematics · Year 13 · Sequences and Series · Summer Term

Sigma Notation and Recurrence Relations

Use sigma notation to represent series concisely and explore sequences defined by a recurrence relation, including simple iterative processes.

TL;DR:This topic introduces two powerful mathematical tools: sigma notation for efficiently expressing sums, and recurrence relations for modelling step-by-step change.

• National Curriculum Attainment Targets
• DfE Subject Content for Mathematics: D4 - Use sigma notation to describe series.
• DfE Subject Content for Mathematics: D5 - Understand and use sequences and series in the context of solving problems, including modelling.

About This Topic

This topic introduces A-Level students to two fundamental concepts in the study of sequences and series: sigma notation and recurrence relations. Sigma notation (Σ) provides a powerful and concise method for representing the sum of a series, a skill that is essential for further work in calculus, particularly with integration as the limit of a sum, and in statistics for defining formulae like mean and variance. It builds upon students' prior knowledge of arithmetic and geometric series from GCSE and the first year of A-Level, abstracting the process of summation into a generalised form.

Recurrence relations offer a different perspective on defining sequences, focusing on the relationship between consecutive terms rather than a direct formula for the nth term. This is particularly relevant for modelling iterative processes found in various fields, such as finance (compound interest), computer science (recursive algorithms), and biology (population dynamics). The analysis of the long-term behaviour of linear recurrence relations of the form u(n+1) = au(n) + b, specifically determining conditions for convergence, divergence, or oscillation, provides a gentle introduction to the core concepts of stability and limits, which are central to university-level mathematics and its applications.

Key Questions

1. Explain how to convert a series written in expanded form into sigma notation.
2. Compare a sequence defined by an nth term formula with one defined by a recurrence relation.
3. Analyse the behaviour of a sequence generated by a linear recurrence relation of the form u(n+1) = au(n) + b.

Learning Objectives

• Represent a finite series using sigma notation.
• Generate terms of a sequence defined by a first-order recurrence relation.
• Analyse the long-term behaviour of a sequence defined by u(n+1) = au(n) + b.
• Determine the limit of a convergent sequence defined by a linear recurrence relation.
• Model real-world situations using recurrence relations.

Key Vocabulary

Sigma Notation (Σ)	A mathematical notation used to write the sum of a set of terms in a compact form.
Recurrence Relation	An equation that defines a sequence recursively; each term is defined as a function of its preceding terms.
Series	The sum of the terms in a sequence.
Convergence	The property of a sequence that approaches a finite limit as the number of terms approaches infinity.
Divergence	The property of a sequence that does not approach a finite limit.
Limit	The value that the terms of a convergent sequence approach.

Watch Out for These Misconceptions

Common Misconception

The upper limit of sigma notation is always the number of terms in the series.

What to Teach Instead

The number of terms is calculated as (upper limit - lower limit + 1). For example, the sum from r=1 to n has n terms, but the sum from r=0 to n has n+1 terms.

Common Misconception

In a recurrence relation u(n+1) = f(u(n)), the input is the term number 'n', not the value of the previous term 'u(n)'.

What to Teach Instead

A recurrence relation defines the next term based on the value of the previous term(s). To find u(n+1), you must substitute the entire value of u(n) into the formula, not just the number n.

Common Misconception

All sequences defined by a recurrence relation must eventually settle on a single value (converge).

What to Teach Instead

A sequence can also diverge (tend towards infinity or negative infinity) or oscillate (fluctuate between values). The long-term behaviour of u(n+1) = au(n) + b depends critically on the value of 'a'.

Active Learning Ideas

Collaborative Problem-Solving

Sigma Notation Match-Up

Students are given two sets of cards: one with series written in expanded form and another with their equivalent sigma notation. In pairs, they must match the corresponding cards, discussing the role of the starting index, the upper limit, and the formula for the rth term.

20 min·Pairs

Collaborative Problem-Solving

Recurrence Relation Explorer

Using a spreadsheet or graphing calculator, students investigate the recurrence relation u(n+1) = au(n) + b. They systematically change the values of 'a' and 'b' and observe the long-term behaviour of the sequence, classifying it as convergent, divergent, or oscillating.

30 min·Individual

Collaborative Problem-Solving

Modelling with Sequences

In small groups, students tackle word problems describing real-world scenarios, such as a savings account with monthly deposits or the depreciation of a car's value. They must decide whether to model the situation with sigma notation (for a total) or a recurrence relation (for a step-by-step value) and then solve the problem.

25 min·Small Groups

Real-World Connections

• Calculating the future value of an investment with regular contributions, such as a pension plan.
• Modelling population growth of a species where the population in one year depends on the population in the previous year.
• Analysing loan repayments, where the outstanding balance each month is calculated based on the previous month's balance, interest, and repayment.
• In computer science, determining the computational cost of recursive algorithms.
• In pharmacology, modelling the concentration of a drug in the bloodstream after repeated doses.

Assessment Ideas

Quick Check

Use mini-whiteboards for students to write the first five terms of a given recurrence relation or to convert a simple arithmetic series into sigma notation.

Quick Check

An exam-style question where students must set up a recurrence relation to model a financial problem (e.g., a mortgage), determine if it will be paid off, and calculate the final payment.

Quick Check

Students complete a traffic light grid to rate their confidence with key skills: writing in sigma notation, generating terms, finding a limit, and applying the concepts to a problem.

Frequently Asked Questions

Why do we need sigma notation if we can just write out the sum with dots?

Sigma notation is unambiguous and more powerful. It is essential for representing infinite series or series with a variable number of terms, and it is a fundamental building block for concepts in calculus and statistics.

Can a sequence be described by both an nth term formula and a recurrence relation?

Yes, many can. For example, an arithmetic progression can be defined by u(n) = a + (n-1)d (nth term) or by u(n+1) = u(n) + d (recurrence relation). The nth term formula is often more efficient for finding a specific term far into the sequence.

How do you find the limit of a sequence defined by u(n+1) = au(n) + b?

First, the sequence only converges to a limit if |a| < 1. If it does converge, the terms get closer and closer, so we can say that as n gets very large, u(n+1) is approximately equal to u(n). We can call this limit L. The equation becomes L = aL + b, which can be solved to find L = b / (1 - a).