Find a value that satisfies an equation using repeated substitution.
Key words
iteration
repeating a step many times
recursive formula
a rule that uses the previous result
suffix notation
using an index to show order, e.g. x_n
How to do it
Write the iteration formula x_{n+1}=f(x_n).
Choose a starting value x_0 close to the real root.
Calculate successive values by substituting into f until changes are tiny.
Take the last value as the approximate solution, rounding to required accuracy.
Watch out for
Always use the same starting value for consistency.
Remember: If values stop changing after several iterations you have found an approximate root.
Iteration Core
Find an approximate solution to an equation using iteration (recursive formulae).
Key words
iteration
repeated application of a formula to produce successive approximations
suffix notation
write the next term as \(x_{n+1}\) and the current term as \(x_n\)
How to do it
Choose an initial value \(x_0\).
Write the recursive formula in suffix form, e.g. \(x_{n+1}=f(x_n)\).
Insert \(x_0\) into the formula to get \(x_1\).
Repeat – insert \(x_1\) to obtain \(x_2\), then \(x_2\) for \(x_3\), and so on.
After the required number of iterations (or when \(|x_{n+1}-x_n|\) is very small) take the last value as your estimate.
Watch out for
If you perform each substitution correctly and round to two decimal places, you will get the marks for this part of the question.
Remember: The method works best when the function is smooth near the root and the initial estimate is reasonably close; otherwise convergence may be slow or fail.
Iteration Stretch
Iteration creates a sequence that hones in on a root. Start from a sensible guess, apply the recurrence repeatedly and stop when successive values are close.
Key words
fixed‑point iteration
Rewrite the equation as x=f(x) and generate x_{n+1}=f(x_n).
recursive formula
Use a previous term to produce the next, e.g. a_{n+1}=g(a_n).
suffix notation
Write the n‑th element as a_n to emphasise the recurrence.
How to do it
Find a suitable fixed‑point form x=f(x) (avoid divisions that change sign or give large derivatives).
Choose an initial guess x₀ close enough to ensure convergence; if |f′(x)|<1 near the root, iteration will converge.
Compute successive terms using xn+1=f(xn); keep a record of each term.
Watch out for
If f′(x) is large in magnitude near the guess, the iteration may diverge or oscillate; adjust f(x) or pick another x₀.
Using an initial guess far from any root can lead to a cycle rather than convergence.
Remember: Iteration shows how simple algebraic rearrangement yields solutions otherwise hard to get exactly. It relates to Newton’s method and limits in Calculus, studying sequence behaviour as n→∞.
✏️ Try 3 quick questions
The sequence \(x_{n+1} = (x_n + 10)/3\) with an initial guess tends towards a limit. What is this limiting value? Write it as an integer.
The sequence is defined by \(a_{n+1}=\sqrt{5+a_n}\) with initial term \(a_0=2\). Find the limit \(L\) of the sequence and give it rounded to one decimal place.
A student claims that after two iterations of \(x_{n+1}=\cos(x_n)\) starting with \(x_0=0.5\), the value will be 0.7391. What is the correct value after two iterations to four decimal places?
There are more on this in 4 Triangles, with hints and worked answers, and real past-paper questions. Carry on there.
Practise it with real exam questions
4 Triangles has quick questions on iteration, real GCSE past-paper questions with their mark schemes, and a revision plan that picks what to work on next.
Questions on this topic for a lesson, homework or revision - a quick "do now", misconception questions, small steps that change one thing at a time, and practice, with answers on the last page.