Step 1 of 9 · Worked example · TEACH
0 of 3 done
Work through the example to CHECK to open the problems.
Reach CHECK to open the problems.Higher Level · Applied Maths · Difference Equations & Discrete Change · Step 1Follow the worked example and explain why each modelling and calculation step is valid.
A sequence has x_0=11 and x_(n+1)=x_n+4. Find x_3, showing each update.
A sequence has x₀ = 11 and xₙ₊₁ = xₙ + 4.
Find x₃, showing each update.
Higher Level Applied Maths · Difference Equations & Discrete Change · Step 1 of 9
A recurrence relation generates a sequence by updating a known starting state at discrete steps.
In exam questions, careful indexing and keeping the required previous values prevent missing or miscounting updates.
A sequence has x₀ = 11 and xₙ₊₁ = xₙ + 4. Find x₃, showing each update.