Euler's Method is a numerical technique for approximating a point on the solution curve of a differential equation by taking repeated small steps, using the slope from dy/dx at each point to estimate the change in y (new y = old y + slope × step size).
Euler's Method is what you do when a differential equation is too messy to solve exactly but you still need a number. Starting from an initial condition, you use dy/dx to find the slope at your current point, then ride the tangent line forward a small horizontal distance (the step size, often written Δx or h). That lands you at a new point, where you recalculate the slope and repeat. The core update is simple: y_new = y_old + (slope at current point) × (step size).
The big idea is that Euler's Method is just tangent line approximation done over and over. One tangent line step drifts away from the true solution curve as you move farther from the point of tangency, so instead of one big jump, you take lots of small hops and re-aim each time. Smaller step sizes mean more hops and a better approximation. This is the heart of Topic 7.5 in Unit 7 (Differential Equations), and it's a BC-only skill.
Euler's Method lives in Topic 7.5 of Unit 7 and supports learning objective 7.5.A, estimating solutions to differential equations. The essential knowledge is direct about it: Euler's method provides a procedure for approximating a solution to a differential equation or a point on a solution curve. It matters because most differential equations on the BC exam can't be solved by separation of variables, and Euler's Method gives you a way to get a usable answer anyway. It also ties together a surprising amount of the course. It reuses linearization from Unit 4, complements slope fields from Topic 7.3, and previews the polynomial-approximation mindset of Unit 10. If you're taking AB, you can skip this one; it only appears on the BC exam.
Keep studying AP Calculus Unit 7
Visual cheatsheet
view galleryTangent Line Approximation / Linearization (Unit 4)
Euler's Method is literally tangent line approximation on repeat. Linearization uses one tangent line to estimate a nearby value; Euler's Method chains several short tangent segments together, re-computing the slope at every stop so the estimate doesn't drift as badly.
Slope Field (Unit 7)
A slope field shows you the slope at every point in the plane; Euler's Method is what happens when you actually walk through that field. Each Euler step follows the little slope segment at your current location, so an Euler path traces an approximate solution curve through the field.
Initial Condition (Unit 7)
Euler's Method can't start without one. The initial condition gives you the launching point (x₀, y₀), and the differential equation tells you which direction to step from there. Change the initial condition and the entire approximated path changes.
Taylor Series Expansion (Unit 10)
Each Euler step is a first-degree Taylor approximation, just the tangent line term. Unit 10 takes the same idea further by adding higher-degree terms for better accuracy near a point, while Euler's Method gets accuracy by shrinking the step size instead.
Euler's Method is BC-only and usually shows up as a quick computation, either a multiple-choice question or one part of a differential equations FRQ. You're typically given dy/dx, an initial condition, and a step size, then asked for the approximate y-value after one or two steps. Expect to do exactly what the practice questions ask. Find the change in y for one iteration (slope × step size), identify your starting x, starting y, and slope from a setup like dy/dx = x² + y with y(1) = 3, and reason about step size (a curvier or faster-changing solution needs a smaller step for a decent approximation). The most common point-loser is forgetting to update the slope between steps. After your first hop, plug the NEW x and NEW y into dy/dx before taking the next one. Showing a clean table of x, y, slope, and Δy is the safest way to organize your work.
Tangent line approximation (linearization, Unit 4) uses ONE tangent line at one point to estimate a nearby function value. Euler's Method uses MANY short tangent steps, recalculating the slope from the differential equation at each new point. If a problem says 'use the tangent line at x = 1,' that's linearization. If it gives you a step size and asks you to iterate, that's Euler's Method. One is a single jump; the other is a chain of hops.
Euler's Method approximates a point on the solution curve of a differential equation using the update rule y_new = y_old + slope × step size.
You must recalculate the slope from dy/dx at each new point before taking the next step; reusing the old slope is the classic mistake.
A smaller step size gives a more accurate approximation because each tangent segment stays closer to the true curve, especially when the solution is changing rapidly.
Euler's Method is just repeated tangent line approximation, so it directly builds on linearization from Unit 4.
It requires an initial condition to start, because the differential equation alone only tells you slopes, not where you are.
Topic 7.5 and Euler's Method are BC-only; AB doesn't test this.
It's a step-by-step procedure for approximating solutions to a differential equation when you can't solve it exactly. Starting from an initial condition, you repeatedly compute y_new = y_old + (dy/dx at current point) × (step size). It's Topic 7.5 in Unit 7.
No. Euler's Method (Topic 7.5) is BC-only. AB covers slope fields and separation of variables in Unit 7, but not Euler's Method.
Tangent line approximation uses one tangent line at a single point to estimate a nearby value. Euler's Method strings together multiple tangent steps, recomputing the slope from the differential equation at every new point. Euler's Method is essentially linearization done repeatedly.
Yes. Smaller steps mean each tangent segment hugs the true solution curve more closely before you re-aim. Exam questions specifically ask which scenarios need a smaller step size, and the answer is usually when the solution curve is steep or changing quickly.
Plug your current x and y into dy/dx to get the slope, multiply that slope by the step size to get Δy, then add Δy to your current y and add the step size to your current x. For example, with slope 4 and step size 3, the change in y for that step is 4 × 3 = 12.