Mathematics · Year 13

Active learning ideas

Sigma Notation and Recurrence Relations

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.

• 20–30 min
• Pairs → Whole Class
• 3 activities

Activity 01

• Collaborative Problem-Solving
• 20 min · Pairs

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.

Explain how to convert a series written in expanded form into sigma notation.

Facilitation Tip

Include a few tricky examples, such as an index starting from 0 or a series with alternating signs.

What to look for

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.

• Apply
• Analyze
• Evaluate
• Create
• Relationship Skills
• Decision-Making
• Self-Management

Activity 02

• Collaborative Problem-Solving
• 30 min · Individual

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.

Compare a sequence defined by an nth term formula with one defined by a recurrence relation.

Facilitation Tip

Encourage students to hypothesise the conditions on 'a' that lead to convergence before formally proving it.

What to look for

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.

• Apply
• Analyze
• Evaluate
• Create
• Relationship Skills
• Decision-Making
• Self-Management

Activity 03

• Collaborative Problem-Solving
• 25 min · Small Groups

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.

Analyse the behaviour of a sequence generated by a linear recurrence relation of the form u(n+1) = au(n) + b.

Facilitation Tip

Provide a structured worksheet to guide them in identifying the initial value, the common ratio/difference, and the recursive step.

What to look for

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.

• Apply
• Analyze
• Evaluate
• Create
• Relationship Skills
• Decision-Making
• Self-Management

A few notes on teaching this unit

Begin by deconstructing sigma notation, focusing on the role of the index, the limits, and the formula. For recurrence relations, use a calculator's ANS button or a spreadsheet to generate terms iteratively, helping students to build an intuitive feel for convergence and divergence before formalising the analysis.

Students will be able to translate between expanded series and sigma notation, and use recurrence relations to model and predict the behaviour of sequences over time.

---

Watch Out for These Misconceptions

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

  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.

• 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)'.

  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.

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

  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'.

---

Methods used in this brief

• Collaborative Problem-Solving