5m left·0%
Reading Time: 5 min
Last Updated: March 13, 2026
Main Ideas: 5
Reading Time: 5 min
Last Updated: March 13, 2026
Main Ideas: 5

Topic 7.5 Notes – Approximating Solutions Using Euler’s Method

Verified for 2027 AP® Calculus BC Exam
Read aloud
Euler’s Method is a numerical way to approximate solutions to differential equations of the form dydx=f(x,y)\frac{dy}{dx} = f(x,y) when you’re given an initial condition. Instead of finding an exact formula for y(x)y(x), you build the solution step-by-step using tangent lines. It’s repeated linear approximation in action.

Euler’s Method

Suppose you’re given

dydx=f(x,y),y(x0)=y0. \frac{dy}{dx} = f(x,y), \quad y(x_0)=y_0.

That initial condition gives you a starting point on the solution curve. The differential equation tells you the slope at any point (x,y)(x,y).

Euler’s idea is simple:

  • Start at (x0,y0)(x_0, y_0).
  • Use the slope there to move a small step forward in xx.
  • Estimate the new yy-value using the tangent line.
  • Repeat.

You’re replacing a curved solution with lots of tiny straight line segments.

The update formula

Everything comes from this one rule:

yn+1=yn+h f(xn,yn) y_{n+1} = y_n + h\, f(x_n, y_n)

Where:

  • hh is the step size
  • (xn,yn)(x_n, y_n) is your current point
  • f(xn,yn)f(x_n, y_n) is the slope at that point
  • xn+1=xn+hx_{n+1} = x_n + h

You’re adding “slope × run” to the current yy.

Running the Algorithm

When you see an Euler question on a quiz or FRQ, it usually becomes a table.

Given:

  • A differential equation
  • An initial condition
  • A step size hh
  • A target xx-value

You repeatedly:

  1. Compute the slope f(xn,yn)f(x_n, y_n).
  2. Multiply by hh.
  3. Add to the current yy.
  4. Increase xx by hh.

Quick example

Suppose

dydx=x−y,y(0)=1,h=0.5. \frac{dy}{dx} = x - y, \quad y(0)=1, \quad h=0.5.

Step 1: Start

  • x0=0x_0=0, y0=1y_0=1
  • Slope: f(0,1)=0−1=−1f(0,1)=0-1=-1

y1=1+0.5(−1)=0.5 y_1 = 1 + 0.5(-1)=0.5

x1=0.5 x_1=0.5

Step 2

  • Slope: f(0.5,0.5)=0.5−0.5=0f(0.5,0.5)=0.5-0.5=0

y2=0.5+0.5(0)=0.5 y_2 = 0.5 + 0.5(0)=0.5

x2=1 x_2=1

So y(1)≈0.5y(1)\approx 0.5.

Notice how every step uses the new point. That’s a very common place to lose points.

Why It Works

At each step, you’re pretending the function behaves like its tangent line over a small interval.

Here’s the geometric picture:

Study guide illustration

Euler’s method as repeated tangent-line approximations

Each short line segment shows you following the tangent line from one point to the next by a horizontal distance hh. At the new point, you recompute the slope and repeat.

This connects directly to:

  • Derivatives as slopes (Unit 2)
  • Linearization L(x)=f(a)+f′(a)(x−a)L(x)=f(a)+f'(a)(x-a)

Euler’s method is repeated linearization.

Step Size and Accuracy

The step size hh controls everything.

  • Smaller hh → more steps → better approximation
  • Larger hh → fewer steps → more accumulated error

Error builds at every step because you’re never on the true curve, only on a tangent line.

Overestimate or underestimate?

If the solution curve is:

  • Increasing and concave up → Euler typically underestimates
  • Increasing and concave down → Euler typically overestimates

That’s because the tangent line sits below or above the curve depending on concavity.

On tests, you may be asked to justify this using concavity or a second derivative argument. Be explicit about why the tangent line lies above or below.

Things That Trip People Up

  • Plugging the wrong values into f(x,y)f(x,y). Always use the current (xn,yn)(x_n, y_n).
  • Rounding too early. Keep several decimals until the final answer.
  • Taking the wrong number of steps. Number of steps =target x−x0h=\frac{\text{target }x - x_0}{h}.
  • Forgetting to stop exactly at the requested xx.

On FRQs, organization matters. A clean table with labeled columns makes scoring easy for the reader.

Key Takeaways

Euler’s update rule is yn+1=yn+hf(xn,yn)y_{n+1}=y_n + h f(x_n,y_n).
Each step uses the slope at the current point, not the original one.
Smaller hh generally improves accuracy but requires more steps.
If the solution is increasing and concave up, Euler’s method usually underestimates.
Euler’s method is repeated linearization using tangent lines.

AP® is a trademark registered by the College Board, which is not affiliated with, and does not endorse this website.

Notes

1 credit used · 5/5 remaining