Euler Method Step: Advance Using the Current Slope

On this page: The Principle | Conditions | Failure Modes | EE Questions | Retrieval Practice | Practice Ground | Solve a Problem | Related Guides | FAQ

---

The Principle

The move: when a first-order differential equation is written as $y'=F(x,y)$ and the current approximation is $(x_n,y_n)$, compute the current slope and step forward by $h$.

The invariant: for this step, the slope source is fixed at the current point: compute $F(x_n,y_n)$ before advancing. Euler’s method is a tangent-line prediction, not a corrected or averaged slope estimate.

Pattern:

$$x_{n+1}=x_n+h,\qquad y_{n+1}=y_n+hF(x_n,y_n)$$

Legal route	Illegal route
$y'=x+y,\ (x_n,y_n)=(1,2),\ h=0.1 \Longrightarrow y_{n+1}=2+0.1F(1,2)$	$y'=x+y,\ (x_n,y_n)=(1,2),\ h=0.1 \Longrightarrow y_{n+1}=2+0.1F(1.1,y_{n+1})$

The illegal route uses information from the next point. That is not one Euler method step; it changes the method into an implicit or corrected update.

---

Conditions of Applicability

Condition: step size h chosen; $local slope evaluated at (x_n,y_n)$

Before applying, check: identify the current point $(x_n,y_n)$, choose the step size $h$, and evaluate $F$ at that same current point.

If the condition is violated: the update may no longer be Euler’s method, because the slope may come from the next point, a midpoint, or an averaged correction.

• Do not use $F(x_{n+1},y_{n+1})$ in this move. That is a different numerical method.
• Do not average slopes from two points. Euler’s method uses the single current local slope.
• In a step table, carry the bookkeeping update $x_{n+1}=x_n+h$ with the y update so the next current point is defined.
• Do not skip the domain check inherited from Direction Field Slope Relation; the point must have a defined slope before it can be stepped forward.

Want the complete framework behind this guide? Read Masterful Learning.

---

Common Failure Modes

Failure mode: use the slope at the next point or average two slopes -> the update no longer matches the Euler method step.

Debug: say the evaluation point out loud before calculating: “the slope is $F(x_n,y_n)$.”

---

Elaborative Encoding

Use these questions to build deep understanding. (See Elaborative Encoding for the full method.)

Within the Principle

• What does each part of $y_n+hF(x_n,y_n)$ contribute to the next approximation?
• Why does the update use $F(x_n,y_n)$ instead of a slope evaluated after the step?

For the Principle

• Before taking one Euler step, what are the two condition checks you must name?
• How would the numerical path change if $h$ were negative?

Between Principles

• How does Euler Method Step use the local slope idea from Direction Field Slope Relation?

Generate an Example

• Give one valid Euler update and one near miss where the slope was evaluated at the wrong point.

---

Retrieval Practice

Answer from memory, then click to reveal and check. (See Retrieval Practice for the full method.)

State the move in one sentence: _____Euler Method Step advances one numerical approximation by adding h times the current slope estimate to the current y value.

Write the canonical pattern: _____$y_{n+1}=y_n+hF(x_n,y_n)$

State the canonical condition: _____$\text{step size h chosen};\, local slope evaluated at (x_n,y_n)$

---

Practice Ground

Use these exercises to build move-selection fluency. (See Self-Explanation for how to learn from worked examples.)

Procedure Walkthrough

Starting from $y'=x+y$, take one Euler step from $(x_0,y_0)=(1,2)$ with $h=0.1$.

Step	Expression	Operation
0	$x_0=1,\quad y_0=2,\quad h=0.1$	State the current point and chosen step size.
1	$F(x_0,y_0)=F(1,2)$	Evaluate the slope at the current point.
2	$F(1,2)=1+2=3$	Compute the local slope.
3	$y_1=y_0+hF(x_0,y_0)=2+0.1(3)$	Apply the Euler update.
4	$x_1=1.1,\quad y_1=2.3$	Finish the next approximation point.

---

Drills

Forward Steps

Apply one Euler method step. Use the stated current point and step size.

$$y'=x-y,\quad (x_n,y_n)=(2,1),\quad h=0.5$$

Reveal

Evaluate the current slope:

$$F(2,1)=2-1=1.$$

Then

$$y_{n+1}=1+0.5(1)=1.5.$$

---

Apply one Euler method step. Use the stated current point and step size.

$$y'=y,\quad (x_n,y_n)=(0,3),\quad h=0.2$$

Reveal

The current slope is $F(0,3)=3$, so

$$y_{n+1}=3+0.2(3)=3.6.$$

---

Apply one Euler method step. Use the stated current point and step size.

$$y'=x^2+y,\quad (x_n,y_n)=(1,1),\quad h=-0.1$$

Reveal

The current slope is $F(1,1)=1^2+1=2$, so

$$y_{n+1}=1+(-0.1)(2)=0.8.$$

The negative $h$ means the step moves backward in $x$.

---

Reject or complete the update. A student uses $F(1.2,y_{n+1})$ for a step from $(1,2)$ with $h=0.2$.

Reveal

Reject it as an Euler method step. The condition says the local slope is evaluated at $(x_n,y_n)$, so the slope source must be $F(1,2)$.

---

Apply one Euler method step. Use the stated current point and step size.

$$y'=\frac{y}{x+1},\quad (x_n,y_n)=(1,4),\quad h=0.25$$

Reveal

The current slope is

$$F(1,4)=\frac{4}{1+1}=2.$$

Then

$$y_{n+1}=4+0.25(2)=4.5.$$

---

Action Labels

What was done between these two steps?

$$F(2,5)=2+5=7 \quad \Longrightarrow \quad y_{n+1}=5+h(7)$$

Reveal

The current slope $F(x_n,y_n)$ was inserted into the Euler update $y_{n+1}=y_n+hF(x_n,y_n)$.

---

Which proposed steps are valid Euler method steps from $(x_n,y_n)=(0,1)$ with $h=0.1$ for $y'=x+y$?

A. $y_{n+1}=1+0.1F(0,1)$
B. $y_{n+1}=1+0.1F(0.1,y_{n+1})$
C. $y_{n+1}=1+0.1\cdot 1$

Reveal

A and C are valid. Since $F(0,1)=1$, C is the evaluated version of A.

B is the near miss: it evaluates the slope at the next point, not at $(x_n,y_n)$.

---

What was done between these two steps?

$$y'=2x-y,\quad (x_n,y_n)=(3,4),\ h=0.2$$ $$y_{n+1}=4+0.2(2)$$

Reveal

The slope was evaluated at the current point:

$$F(3,4)=2(3)-4=2,$$

then substituted into the Euler update.

---

A student averages $F(x_n,y_n)$ and $F(x_{n+1},y_{n+1})$ before updating. Is that Euler Method Step?

Reveal

No. The Euler method step uses one current slope, $F(x_n,y_n)$. Averaging a current and next slope is a different correction idea.

---

Choose the eligible slope source for one Euler step.

$$y'=\sqrt{x+y},\quad (x_n,y_n)=(1,3),\quad h=0.4$$

A. $F(1,3)$
B. $F(1.4,3)$
C. $F(1.4,y_{n+1})$

Reveal

A is eligible. The slope must be evaluated at the current point $(x_n,y_n)$ before the update.

B and C use a next $x$ value, so they are not one Euler method step.

---

Solve a Problem

Apply what you’ve learned with Problem Solving.

Problem: Starting from $y'=x+y$, take two Euler method steps from $(x_0,y_0)=(0,1)$ with $h=0.5$. Report $y_2$.

Full solution

Step	Expression	Move
0	$x_0=0,\quad y_0=1,\quad h=0.5$	State the initial point and step size.
1	$F(x_0,y_0)=F(0,1)=1$	Evaluate the first slope at the current point.
2	$y_1=1+0.5(1)=1.5$	Apply the first Euler update.
3	$x_1=0.5,\quad F(x_1,y_1)=F(0.5,1.5)=2$	Shift to the new current point and evaluate the next current slope.
4	$y_2=1.5+0.5(2)=2.5$	Apply the second Euler update.

---

Related Guides

• Differential Equations Subdomain - See where numerical stepping sits after slope fields.
• Direction Field Slope Relation - Connect the current slope $F(x_n,y_n)$ to the local tangent direction.
• First-Order Explicit Differential Equation Form - Put the equation in the form $y'=F(x,y)$ before stepping.
• Initial Condition Particular Solution - Review how a starting point selects the trajectory being approximated.
• Principle Structures - Keep the equation, condition, and update move separate in memory.

---

FAQ

What is Euler Method Step?

Euler Method Step is the numerical update $y_{n+1}=y_n+hF(x_n,y_n)$. It starts from the current approximation $(x_n,y_n)$, evaluates the differential equation’s slope there, and uses a tangent-line step to estimate the next $y$ value.

When is Euler Method Step valid?

It is valid when the step size $h$ has been chosen and the local slope is evaluated at $(x_n,y_n)$. You also need the current point to lie in the domain of the slope rule $F$.

Does Euler’s method use the slope at the next point?

No. A standard Euler method step uses the current slope $F(x_n,y_n)$. If you use $F(x_{n+1},y_{n+1})$ or an average of two slopes, you have changed the numerical method.

Is this explicit Euler or implicit Euler?

This guide covers the standard explicit Euler step. Explicit Euler evaluates the slope at the current point, $F(x_n,y_n)$. Implicit Euler uses the next point, such as $F(x_{n+1},y_{n+1})$, and is a different numerical method.

Why does the formula add h times the slope?

The slope estimates the change in $y$ per unit change in $x$. Multiplying by the step size $h$ estimates the change in $y$ over that horizontal step, then adding it to $y_n$ gives the next approximation.

How is this related to direction fields?

A direction field assigns a local slope at each valid point. Euler Method Step follows one of those local slope segments for a chosen step size.

---

How This Fits in Unisium

Within the differential equations subdomain, Unisium treats Euler’s method as a legality check plus a numerical update: choose $h$, evaluate the current slope, then step. The Unisium Study System pairs that check with retrieval practice, self-explanation, and compact problem-solving chains so the current-point condition stays visible during calculation.

Ready to practice differential equations with structure? Check access and join the Unisium waitlist or explore the complete framework in Masterful Learning.

Masterful Learning

The book behind these guides: a study system for physics, math, & programming built on retrieval, connection, explanation, and problem solving.

About the book →