Both papers · free lessons

Sequences & series for the TMUA

Use explicit and recursive definitions, identify arithmetic and geometric sequences, and find sums.

Paper
Both papers
Lessons free
3 of 6
Free lesson time
27 min
All lessons
80 min

In the released papers: 29 of 320 questions.

What the specification says

Sequences & series on the TMUA

Read the full specification(PDF from UAT-UK, opens in a new tab)
  • Use position-to-term formulae and simple recurrence relations.

  • Find and sum arithmetic sequences.

  • Sum finite geometric series and convergent geometric series to infinity.

  • Reason about long-term behaviour, periodicity and constraints on terms.

Lesson 1 · 8 min

Separate explicit and recursive rules

An explicit rule jumps to any term; a recurrence builds the next term from earlier information.

The idea

An explicit rule stores every term in one formula; a recurrence stores a process plus starting data. Neither description is automatically more informative, and converting between them may reveal long-term behaviour.

Early terms are evidence for a pattern, not proof. A recurrence proof must show the starting case and that the rule carries the claimed form from one term to the next.

When to use it

Use a short term table to discover structure, then express the invariant or repeated change algebraically.

Main steps

  1. 1

    For un=f(n)u_n=f(n), substitute the position directly.

  2. 2

    A recurrence needs starting value information as well as the rule.

  3. 3

    Compute a few exact terms to test a conjecture, but use algebra to prove a pattern.

Worked example

Let u1=2u_1=2 and un+1=3un−1u_{n+1}=3u_n-1. Find u4u_4.

Try it first, then show the solution
  1. 1

    u2=3(2)−1=5u_2=3(2)-1=5.

  2. 2

    u3=3(5)−1=14u_3=3(5)-1=14.

  3. 3

    u4=3(14)−1u_4=3(14)-1.

Answer

u4=41u_4=41.

Lesson check

Try this without looking back at the example.

If v1=7v_1=7 and vn+1=vn−3v_{n+1}=v_n-3, what is v5v_5?

Answer options

Save your progress and track this lesson's check with a free account.

Create a free account

Lesson 2 · 8 min

Exploit constant difference

Arithmetic sequences are linear in the term number and pair naturally from the ends.

The idea

A constant first difference makes the term number and term value linearly related. The (n−1)(n-1) appears because the first term has undergone zero steps.

The sum formula comes from pairing terms at equal distance from the ends; every pair has the same total. This viewpoint also handles partial or offset arithmetic sums cleanly.

When to use it

Translate each supplied term into a+(n−1)da+(n-1)d; subtract separated-term equations before solving for the first term.

Main steps

  1. 1

    un=a+(n−1)du_n=a+(n-1)d for first term aa and common difference dd.

  2. 2

    Sn=n2(2a+(n−1)d)=n2(a+l)S_n=\frac{n}{2}\left(2a+(n-1)d\right)=\frac{n}{2}(a+l).

  3. 3

    When given two separated terms, subtract their equations to isolate the common difference.

Worked example

An arithmetic sequence has u4=11u_4=11 and u10=29u_{10}=29. Find u1u_1.

Try it first, then show the solution
  1. 1

    a+3d=11a+3d=11 and a+9d=29a+9d=29.

  2. 2

    Subtract to get 6d=186d=18, hence d=3d=3.

  3. 3

    Use a+3d=11a+3d=11.

Answer

a=2a=2.

Lesson check

Try this without looking back at the example.

What is the sum of the first 2020 positive integers?

Answer options

Save your progress and track this lesson's check with a free account.

Create a free account

Lesson 3 · 11 min

Control repeated multiplication

Geometric series turn repeated scaling into a closed formula; infinite totals exist only when terms shrink to zero.

The idea

A geometric sequence has multiplicative memory: every term is a scaled version of the previous one. Its finite sum formula comes from subtracting the original series from a shifted copy.

An infinite sum exists only when the omitted tail tends to zero. The condition ∣r∣<1|r|<1 is therefore a mathematical requirement, not an optional formula note.

When to use it

Identify aa and rr, decide finite versus infinite, and verify convergence before substituting.

Main steps

  1. 1

    un=arn−1u_n=ar^{n-1} and Sn=a(1−rn)1−rS_n=\frac{a(1-r^n)}{1-r} for r≠1r\neq1.

  2. 2

    S∞=a1−rS_\infty=\frac{a}{1-r} only when ∣r∣<1|r|<1.

  3. 3

    A negative ratio alternates signs; convergence depends on ∣r∣|r|, not merely r<1r<1.

Worked example

A geometric series begins 12,−6,3,…12, -6, 3, \ldots. Find its sum to infinity.

Try it first, then show the solution
  1. 1

    The common ratio is r=−12r=-\frac{1}{2}.

  2. 2

    Since ∣r∣=12<1|r|=\frac{1}{2}<1, the series converges.

  3. 3

    Use S∞=121−(−12)S_\infty=\frac{12}{1-(-\frac{1}{2})}.

Answer

S∞=8S_\infty=8.

Lesson check

Try this without looking back at the example.

Which geometric sequence has a convergent sum to infinity?

Answer options

Save your progress and track this lesson's check with a free account.

Create a free account

Included with premium

3 more sequences & series lessons

These go further, up to difficulty 4–5 question types, and connect to matched practice from the question bank.

  • Shift to a fixed point

    A recurrence that is not visibly geometric may become geometric after subtracting its fixed point.

    15 minDifficulty 4–5Premium

  • Finite states, cycles and recurrence invariants

    A distant recurrence term becomes accessible once the sequence enters a repeated state or a remainder pattern restricts every future state.

    19 minDifficulty 4–5Premium

  • Periodic trigonometric weights in infinite series

    A trigonometric sequence with a short exact period can be grouped into blocks that form an ordinary convergent geometric series.

    19 minDifficulty 4–5Premium

Your next step

Practise sequences & series under exam conditions

Free, no account needed

Take the timed diagnostic

20 Forge-original questions under exam timing, calibrated to the 2023 paper's difficulty profile. You get a score and a topic-by-topic breakdown at the end.

Start the free diagnostic

Free account

Save your progress

Create a free account for 41 free lessons and 4 methods in Learn, with progress kept on this device, and free sittings of released past papers.

Create a free account

Premium

Practise at the harder level

561 Forge originals calibrated for the harder computer-based papers sat since 2024, with worked solutions, unlimited mocks, all 104 lessons and 18 methods.

£49 for 12 months or £20 for 30 days. One payment, no automatic renewal.

See premium