All mind maps topics

First-order recurrence relationsEdexcel A-Level Further Maths: Mind map

Relation
Complementary function

First-order recurrence relations

solve and prove

CF + PSclosed forminduction
Particular solution
Closed form
Induction

Exam questions on First-order recurrence relations

  1. A sequence is defined by un+1−5un=8u_{n+1}-5u_n=8 for n≥1n\geq1, with u1=1u_1=1.
    Hence find unu_n in terms of nn.2 marks
  2. A fish farm models the number of fish PnP_n in a lake at the start of year nn by Pn+1=1.15Pn−60P_{n+1}=1.15P_n-60, with P1=500P_1=500. Each year the population grows by 15% and then 60 fish are removed.
    Given that Pn=100(1.15)n−1+400P_n=100(1.15)^{n-1}+400, find the first year in which the population exceeds 10001000.2 marks
  3. A sequence satisfies un+1−2un=6nu_{n+1}-2u_n=6n for n≥1n\geq1, with u1=5u_1=5.
    Find the complementary function and a particular solution of the form un=an+bu_n=an+b.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).