All revision notes topics

Sequences and recurrence relationsAQA A-Level Maths: Revision notes

Section 1

Sequences and the nth term

A sequence is an ordered list of numbers u1,u2,u3,…u_1,u_2,u_3,\dots. It can be defined by a formula for the nnth term, such as un=n2−3nu_n=n^2-3n, which gives any term directly: u5=25−15=10u_5=25-15=10. To find the position of a given value, solve an equation in nn. For an=nn+2a_n=\frac{n}{n+2}, the first term exceeding 0.90.9 needs nn+2>0.9\frac{n}{n+2}>0.9, so n>18n>18. The first such term is a19a_{19}, because a18=0.9a_{18}=0.9 exactly.

Key termssequencenth term
Common mistake

Treating a boundary value as satisfying a strict inequality: a18=0.9a_{18}=0.9 is not greater than 0.90.9.

Section 2

Recurrence relations

A recurrence relation (or iterative formula) of the form xn+1=f(xn)x_{n+1}=f(x_n) builds each term from the one before. It needs a starting value, such as x1x_1. Example: u1=3u_1=3, un+1=2un−1u_{n+1}=2u_n-1 gives 3,5,9,17,33,…3,5,9,17,33,\dots Work term by term, keeping exact values (fractions) when the question does not ask for decimals. Check a proposed formula by substituting it into the relation: if un=2n+1u_n=2^n+1 then 2un−1=2n+1+1=un+12u_n-1=2^{n+1}+1=u_{n+1}, and u1=3u_1=3, so the formula fits.

Key termsrecurrence relation
Exam tip

Write each term on its own line so that a slip in x3x_3 does not silently ruin x4x_4.

Section 3

Increasing and decreasing sequences

A sequence is increasing if un+1>unu_{n+1}>u_n for all nn, and decreasing if un+1<unu_{n+1}<u_n for all nn. To prove it, look at the sign of un+1−unu_{n+1}-u_n. For an=nn+2a_n=\frac{n}{n+2}: an+1−an=(n+1)(n+2)−n(n+3)(n+2)(n+3)=2(n+2)(n+3)>0,a_{n+1}-a_n=\frac{(n+1)(n+2)-n(n+3)}{(n+2)(n+3)}=\frac{2}{(n+2)(n+3)}>0, so the sequence is increasing. A few terms are not a proof: you must show the inequality for all nn. Some sequences are neither, such as 1,−1,1,−1,…1,-1,1,-1,\dots

Key termsincreasingdecreasing
Common mistake

Checking two or three terms and calling the sequence increasing. State the general condition.

Section 4

Periodic sequences

A sequence is periodic with order (period) kk if un+k=unu_{n+k}=u_n for all nn: the same kk terms repeat. Take x1=2x_1=2 and xn+1=11−xnx_{n+1}=\frac{1}{1-x_n}: 2, −1, 12, 2, −1, 12,…2,\ -1,\ \tfrac12,\ 2,\ -1,\ \tfrac12,\dots This has order 33. To find a late term, divide the position by the order and use the remainder: 100=3×33+1100=3\times33+1, so x100=x1=2x_{100}=x_1=2. For a sum, add up whole cycles and then the leftover terms: one cycle sums to 32\frac32, so the first 100100 terms sum to 33×32+2=51.533\times\frac32+2=51.5.

Key termsperiodicorder
Exam tip

A remainder of 00 means the last term of the cycle, not the first.

Section 5

Sequences with an unknown constant

Many questions give a relation containing a constant kk, e.g. un+1=kun+4u_{n+1}=ku_n+4 with u1=1u_1=1. Express the first few terms in terms of kk: u2=k+4,u3=k(k+4)+4=(k+2)2.u_2=k+4,\qquad u_3=k(k+4)+4=(k+2)^2. Then use the extra information. If u3=25u_3=25 and k>0k>0 then k=3k=3 and u4=79u_4=79. If u3=u1u_3=u_1 then (k+2)2=1(k+2)^2=1, so k=−1k=-1 (giving 1,3,1,3,…1,3,1,3,\dots, order 22) or k=−3k=-3 (giving a constant sequence 1,1,1,…1,1,1,\dots). Check each solution against any condition stated in the question and describe the resulting sequence.

Common mistake

Keeping both roots of a quadratic when the question says k>0k>0.

That's the notes covered.

Carry on to the next subtopic.

Exam questions on Sequences and recurrence relations

  1. A sequence is defined by u1=3u_1=3 and un+1=2un−1u_{n+1}=2u_n-1 for n≥1n\ge1.
    Show that un=2n+1u_n=2^n+1 satisfies both u1=3u_1=3 and the relation un+1=2un−1u_{n+1}=2u_n-1.2 marks
  2. A sequence has nnth term an=nn+2a_n=\frac{n}{n+2} for n≥1n\ge1.
    Prove that the sequence is increasing.2 marks
  3. A sequence is defined by x1=2x_1=2 and xn+1=11−xnx_{n+1}=\frac{1}{1-x_n} for n≥1n\ge1.
    Find x2x_2, x3x_3 and x4x_4, and state what this shows about the sequence.3 marks
See the full worksheet

Written by the Exaim team, led by Shaun Daswani (Head of Upper Secondary, Improve ME Institute; MSc Financial Mathematics, Imperial College London; BSc, UCL) and Jason Daswani (operational lead, Improve ME Institute; LSE).