Prove the recurrence formula by induction and give f(xₙ), as requested by the printed wording.
Official paper · jm01-2026 · II.5(a)(ii) · PDF 5
Official original and suggested answers ↗ · Suggested answer PDF page 8
Skills and prerequisite lessons
Working and explanation
BUILD THE REASONING
Hint 1
Hint 2
Worked solution
The base case n=1 gives 3/2, as required.
Assume the formula for k, then apply the recurrence.
Thus induction establishes xₙ; applying f increases the index by one.
xₙ=3/(n+1); therefore f(xₙ)=3/(n+2).
Checks and common pitfalls: The printed question asks for f(xₙ), whereas the suggested answer proves xₙ. Both are shown to avoid an off-by-one error.
Reasoning checklist · self / teacher assessment
- Teaching assessment checklist, independently authored. Use the original paper for official marks.
- The base case n=1 gives 3/2, as required.
- Assume the formula for k, then apply the recurrence.
- Thus induction establishes xₙ; applying f increases the index by one.
Think first. Reveal a hint when the class is ready.