Step 1 of 9 · Worked example · TEACH

← Difference Equations & Discrete Change

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 1

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

Read it once, slowly. Then copy it onto your page.
  • What is going on? A list of numbers is built one at a time. The first one is given: x₀ = 11.
  • What is fixed? The rule xₙ₊₁ = xₙ + 4: each new number is the one before plus 4.
  • What do they want? The value of x₃, showing each update: one line for every use of the rule.
Céim

Higher Level Applied Maths · Difference Equations & Discrete Change · Step 1 of 9

Sequences, State Variables & Recurrence Relations

A recurrence relation generates a sequence by updating a known starting state at discrete steps.

Why it matters

In exam questions, careful indexing and keeping the required previous values prevent missing or miscounting updates.

The worked example

A sequence has x₀ = 11 and xₙ₊₁ = xₙ + 4. Find x₃, showing each update.

How the worked example goes

  1. Read

    • What is going on? A list of numbers is built one at a time. The first one is given: x₀ = 11.
    • What is fixed? The rule xₙ₊₁ = xₙ + 4: each new number is the one before plus 4.
    • What do they want? The value of x₃, showing each update: one line for every use of the rule.
  2. Understand

    • How do I picture it?
    • Picture a row of boxes. The small number under x is the box's position, counted from 0.
    • Position and value
  3. Reduce

    • From x₀ to x₃: how many updates? 3 updates: Position 0 to 1, 1 to 2, 2 to 3: three moves, so three updates.
    • Where do I start?
    • Use the rule with n = 0, then n = 1, then n = 2. Each line feeds the newest term in.
  4. Solve

    • Update three times.
    • Start from the initial condition, 11. Each answer becomes the next line's input.
    • x₀ = 11
  5. Check

    • Is it right?
    • Three updates of + 4 add 12 in all: 11 + 3 × 4 = 23 ✓
    • Undo the three updates: 23 − 4 − 4 − 4 = 11, back to x₀ ✓