Approximating solutions using Euler's method (BC only) — AP Calculus BC
1. What is Euler's Method? ★★☆☆☆ ⏱ 2 min
Euler's method is a numerical iterative technique for approximating values of the unknown solution $y(x)$ to a first-order initial value problem (IVP) of the form $\frac{dy}{dx} = f(x,y)$, $y(x_0) = y_0$. Unlike analytical methods such as separation of variables that give an exact closed-form solution, Euler's method works even when an exact solution cannot be found easily.
It is tested exclusively on the AP Calculus BC exam, making up approximately 2-3% of the total exam score, and appears in both multiple-choice and free-response questions, often paired with other differential equation topics like slope fields or population growth. The core intuition uses tangent line approximation at each known point to step to the next x-value iteratively.
2. The Euler's Method Recursive Formula ★★☆☆☆ ⏱ 4 min
The core of Euler's method is breaking the interval from the initial $x$-value $x_0$ to the target $x$-value $x_t$ into $n$ equal steps, each of size $h$ (called step size). The formula for step size is:
h = \frac{x_t - x_0}{n}
Starting from the known initial point $(x_0, y_0)$, we use the slope from the differential equation at the start of the step to approximate the y-value at the end of the step. The general recursive formulas are:
x_k = x_0 + k \cdot h
y_k = y_{k-1} + h \cdot f(x_{k-1}, y_{k-1})
Exam tip: Always write down the number of steps you need before starting calculations. It is extremely common to do one fewer step than required, especially when step size is a fraction and target x is a whole number.
3. Identifying Over- and Under-Approximation ★★★☆☆ ⏱ 4 min
After calculating an approximation, AP questions often ask if it is higher or lower than the exact value. This depends on the concavity of the solution over the entire interval, since each step uses the tangent line at the start of the step to approximate the whole interval:
- If $y'' > 0$ (concave up), tangent lines lie below the solution curve, so the approximation is an **under-approximation**
- If $y'' < 0$ (concave down), tangent lines lie above the solution curve, so the approximation is an **over-approximation**
To find the sign of $y''$, differentiate the original differential equation implicitly, then substitute $y' = f(x,y)$ to get $y''$ in terms of $x$ and $y$ before checking its sign.
Exam tip: You can only conclude over/under approximation if $y''$ has constant sign over the entire interval. If concavity changes, you cannot make a general claim about the final approximation.
4. Step Size and Error Behavior ★★★☆☆ ⏱ 3 min
Euler's method is a first-order numerical method, meaning total global error is approximately proportional to step size $h$, or $E = k \cdot h$ where $k$ is constant for a given IVP and target. Smaller step size always produces a more accurate approximation, and on the AP exam you will never need more than 3-4 steps for any question.
Common Pitfalls
Why: Students forget the initial point is step 0, not step 1, so they miscount the number of steps needed.
Why: Students mix up the recursive order; $y_k$ is unknown when calculating the step.
Why: Students mix up the position of the tangent line relative to the solution curve.
Why: Students confuse Euler's first-order error with second-order error for untested higher-order methods.
Why: Students mix up the formula when given a fixed number of steps $n$.
Why: Students stop after implicit differentiation and forget to substitute the original differential equation.