Is Euler's method on the AP Calculus BC exam but not AB?

Yes. Euler's method is a BC-only topic. AB students study slope fields and separation of variables but are not required to perform Euler's iteration.

How many steps should I expect on an exam problem?

Usually two or three steps with a convenient step size such as 0.1, 0.25, or 0.5. The arithmetic is kept manageable so the focus stays on applying the iteration correctly, not on heavy computation.

How do I know if my answer is an overestimate or underestimate?

Find the second derivative by differentiating the differential equation. If y''>0 (concave up) the estimate is too low, an underestimate; if y''<0 (concave down) it is too high, an overestimate. Always justify with concavity, not intuition.

What happens if the step size is negative?

A negative h simply steps backward in x, letting you approximate a solution value to the left of the initial condition. The same formula y_n+1=y_n+h· f(x_n,y_n) applies; just be careful with signs.

AP-CALCBC-7.5

U7.5 Euler's Method

Q: What happens if the step size is negative?

A negative h simply steps backward in x, letting you approximate a solution value to the left of the initial condition. The same formula y_n+1=y_n+h· f(x_n,y_n) applies; just be careful with signs.

Master Euler's method for AP Calculus BC: iterate y_{n+1}=yₙ+h·f(xₙ,yₙ) to approximate differential equation solutions, avoid step errors, and ace FRQ questions.

What you'll do in this lesson

A voice-first session with the Crimsora tutor on U7.5 Euler's Method, then targeted practice and FRQs — with the tutor adapting to where you get stuck.

Start U7.5 Euler's Method free

What this lesson covers

Sometimes a differential equation is too messy to solve exactly, but you still need a number. Euler's method is calculus's answer: it uses the slope at a known point to take small, straight-line steps toward the solution. Given

\frac{dy}{dx}=f(x,y)

and a starting point, you march forward one step at a time.

This is a BC-only topic that appears in both multiple-choice and free-response questions. The math is just repeated arithmetic, so the points come from staying organized and not making sign or step-size errors. In this lesson you'll learn the iteration formula, why it works geometrically, how to run it in a table, and the common traps the exam loves to set.

The Core Idea and Formula

Euler's method approximates the solution to a differential equation

\frac{dy}{dx}=f(x,y)

with initial condition

y(x_0)=y_0

. Because the derivative tells you the slope of the solution curve at any point, you can start at the known point and follow the tangent line a short horizontal distance

h

, then repeat from the new point.

The iteration formula is

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

and the

x

-values advance by

x_{n+1}=x_n+h

, where

h

is the step size. In words: new

y

equals old

y

plus (step size)(slope at the old point). This is exactly the linear approximation

y\approx y_0+f(x_0,y_0)(x-x_0)

applied one step at a time.

The reason it works is the local linearity of differentiable functions: over a tiny interval, the curve looks nearly straight, so following the tangent is a decent estimate. Chaining these tangent segments builds a polygonal path that tracks the true solution. Smaller

h

means more steps, more accuracy, but more arithmetic. The exam usually gives you two or three steps with a friendly

h

0.1

0.5

Running Euler's Method in a Table

Organization wins points. Set up a table with columns for

x_n

y_n

, the slope

f(x_n,y_n)

, and the update

h\cdot f(x_n,y_n)

. Fill one row per step so you never lose track of which point supplies the slope.

Suppose

\frac{dy}{dx}=x+y

with

y(0)=1

and

h=0.5

, approximating

y(1)

$n$	$x_n$	$y_n$	slope $x_n+y_n$	$h\cdot$ slope	$y_{n+1}$
0	0	1	1	0.5	1.5
1	0.5	1.5	2	1	2.5

After two steps,

x=1

and

y\approx 2.5

. Notice the slope is always evaluated at the current row's point, not the new one. A frequent error is computing the slope with the updated

y

before finishing the step, which corrupts every later value.

The number of steps equals the total change in

x

divided by

h

. To go from

x=0

x=1

with

h=0.5

takes two steps; with

h=0.25

it takes four. Always confirm you land exactly on the target

x

-value.

Overestimate, Underestimate, and Error

The exam often asks whether Euler's method over- or underestimates the true value. The tangent-line reasoning from concavity answers this. If the solution curve is concave up on the interval, its tangent lines lie below the curve, so each Euler step lands too low and the method underestimates. If the curve is concave down, tangent lines lie above and Euler overestimates.

Concavity of solution	Tangent line position	Euler estimate
Concave up ( $y''>0$ )	below curve	underestimate
Concave down ( $y''<0$ )	above curve	overestimate

To determine concavity, differentiate the differential equation. For

\frac{dy}{dx}=x+y

, apply the chain rule:

y''=1+y'=1+x+y

. On a region where this is positive, expect underestimation.

Error shrinks as

h

shrinks. Euler's method has error roughly proportional to

h

(first order), so halving the step size roughly halves the error. You will not compute exact error on the exam, but you should be able to say a smaller step size gives a more accurate approximation because each straight segment deviates less from the true curve.

How the Exam Tests It and Common Traps

On multiple-choice, expect a two-step Euler problem with clean numbers where distractors come from arithmetic slips. On free-response, a differential equation problem often bundles Euler's method with slope fields (U7.3) and separation of variables (U7.6): one part asks for two Euler steps, another asks for the exact solution or a slope-field sketch.

Top traps to avoid. First, using the wrong point for the slope, always plug in the current

(x_n,y_n)

. Second, forgetting to multiply by

h

; the increment is

h\cdot f

, not just

f

. Third, miscounting steps and stopping at the wrong

x

. Fourth, sign errors when

f

h

is negative, Euler works backward with negative

h

too. Fifth, rounding too early; keep full precision until the final answer.

A disciplined approach: write the formula, build the table, compute slopes exactly, and box the final

y

. Show every step, partial credit on FRQs rewards a visible, correct process even if one arithmetic value is off. If asked to justify over/underestimation, cite the sign of

y''

, not just intuition.

Key terms

Euler's method.: A numerical technique that approximates the solution of a differential equation by stepping along tangent lines using $y_{n+1}=y_n+h\cdot f(x_n,y_n)$ .
Step size ( $h$ ).: The fixed horizontal increment between successive $x$ -values; smaller $h$ generally yields a more accurate approximation.
Iteration.: Repeating the update formula, using each new point as the starting point for the next step.
Initial condition.: A given point $y(x_0)=y_0$ that anchors the approximation and provides the starting row of the table.
Local linearity.: The property that a differentiable curve closely resembles its tangent line over a small interval, which justifies Euler's method.
Concavity test for error.: Using the sign of $y''$ to decide whether tangent-based Euler estimates fall below (concave up, underestimate) or above (concave down, overestimate) the true curve.

Worked example

Let

\frac{dy}{dx}=2x-y

with initial condition

y(1)=3

. Use Euler's method with step size

h=0.2

to approximate

y(1.4)

. Then state whether the approximation likely over- or underestimates the true value, justifying with concavity.

Start at

(x_0,y_0)=(1,3)

and take two steps of size

0.2

to reach

x=1.4

.

Step 1: slope at

(1,3)

f=2(1)-3=-1

. Update:

y_1=3+0.2(-1)=2.8

. New

x_1=1.2

.

Step 2: slope at

(1.2,2.8)

f=2(1.2)-2.8=2.4-2.8=-0.4

. Update:

y_2=2.8+0.2(-0.4)=2.8-0.08=2.72

. New

x_2=1.4

.

So

y(1.4)\approx 2.72

.

For concavity, differentiate the equation:

y''=\frac{d}{dx}(2x-y)=2-y'=2-(2x-y)=2-2x+y

. At the starting point

(1,3)

y''=2-2+3=3>0

, and it stays positive over this short interval. Since the solution is concave up, its tangent lines lie below the curve, so Euler's method underestimates the true value

y(1.4)

Practice questions

Given

\frac{dy}{dx}=x+2y

with

y(0)=1

, use Euler's method with

h=0.1

to approximate

y(0.2)

$1.24$
$1.42$
$1.20$
$1.45$

Answer: $1.45$

Step 1 at

(0,1)

: slope

=0+2(1)=2

, so

y_1=1+0.1(2)=1.2

x=0.1

. Step 2 at

(0.1,1.2)

: slope

=0.1+2(1.2)=2.5

, so

y_2=1.2+0.1(2.5)=1.2+0.25=1.45

x=0.2

. The key skill is evaluating each slope at the current point and multiplying by

h

A solution to

\frac{dy}{dx}=f(x,y)

is known to be concave down over the interval used. Explain what this implies about a Euler's method approximation on that interval and why.

Answer: It implies Euler's method overestimates the true solution value.

When a curve is concave down,

y''<0

, and every tangent line lies above the curve. Euler's method follows tangent segments, so each step lands slightly above where the true solution goes. Accumulated over multiple steps, the polygonal Euler path sits above the actual curve, producing an overestimate. This concavity argument, not mere guessing, is what earns justification points on free-response questions.

For

\frac{dy}{dx}=y-x

with

y(2)=4

, perform one Euler step with

h=0.5

and give the approximation for

y(2.5)

Answer: $y(2.5)\approx 5$

The slope at

(2,4)

f=4-2=2

. One step gives

y_1=4+0.5(2)=4+1=5

x=2.5

. A single step is just the tangent-line (linear) approximation, which shows Euler's method reduces to local linearization when only one step is taken.

FAQ

Is Euler's method on the AP Calculus BC exam but not AB?: Yes. Euler's method is a BC-only topic. AB students study slope fields and separation of variables but are not required to perform Euler's iteration.
How many steps should I expect on an exam problem?: Usually two or three steps with a convenient step size such as $0.1$ , $0.25$ , or $0.5$ . The arithmetic is kept manageable so the focus stays on applying the iteration correctly, not on heavy computation.
How do I know if my answer is an overestimate or underestimate?: Find the second derivative by differentiating the differential equation. If $y''>0$ (concave up) the estimate is too low, an underestimate; if $y''<0$ (concave down) it is too high, an overestimate. Always justify with concavity, not intuition.
What happens if the step size is negative?: A negative $h$ simply steps backward in $x$ , letting you approximate a solution value to the left of the initial condition. The same formula $y_{n+1}=y_n+h\cdot f(x_n,y_n)$ applies; just be careful with signs.

Learn this with a teacher, not a page

The Crimsora tutor teaches U7.5 Euler's Method live — explaining on a whiteboard, asking you questions, and adapting to where you get stuck.

Try a live session free