Euler's numerical method (HL)
Studied in greater depth in AI HL than AA HL, Euler’s method is made easy here on TI 84, TI Nspire, Casio fx-9860GIII, Casio fx-CG50, HP Prime, and NumWorks.
Also at the end is a second order DE for Math AI HL.
Re-written on 2026-03-17. Updated 2026-05-13 with plotting a coupled DE
Contents
Theory
In interpretations of derivatives, it was mentioned that a smooth curve can be approximated by a series of jagged lines segments as each line segment becomes small.
This is exactly what we do in Euler’s method.
Given some differential equation
and some initial point , and a step size , then each successive value of , and is
Note that depends on both and , but depends only on .
is the estimate for the gradient of the line. is . So the equation for is saying
is positive or negative depending on if moving to the right or left.
Note: IB may ask for or . You may also get
and other variables. If that happens treat the as and the as .
GDC Procedure
Example: Given that
use Euler’s method with a step size of , estimate when
Solution:
Commentary: Using question variables, write down the Euler’s method formula with the derivative substituted in. To avoid data entry errors, write down the correspondence between calculator variables (usually u_n, v_n or a_n, b_n). Also good idea to wrap the derivative in parentheses ( ).
| 0 | 1 |
| 0.1 | 1.1 |
| … | … |
| 0.5 | 1.623 |
when
Tip: In the past, IB has asked for over 15 iterations of Euler’s method. I recommend to write down Euler’s method formula with substitutions, and a correct coordinate for each remaining mark, and always include the starting point, first and last iterations.
Warning: Check if question wants a point or just the -value. Answer the question as asked.
Here’s how to do it on each graphing calculator. To plot the solution, check out Second order and coupled DE (AI HL only).
Generally, we can either use calculation chaining or recursive sequences. Try both methods across multiple questions, and pick what you prefer.
chaining ( then )
This method is by Dr. William J. Larson for TI 84 Plus, then I expanded it for several other graphic display calculator (GDC) models as well.
Because the new Y depends on the old value of X, we update Y before X. We should also see the new values. We need to chain everything in a single calculation, so Enter or EXE can re-run the last calculation and update both variables.
Initialize
X, Y, H. StoringH(step size) is optional.0→X
1→Y
0.1→HTI uses
:Casio uses⤶HP uses;to chain calculations.separate:
Y+H(Y^2/(1+X))→Y
X+H→X
{X,Y}chained:
Y+H(Y^2/(1+X))→Y:X+H→X:{X,Y}Press Enter or EXE button until we see the desired
X. Note: No need to re-enter the expression.
Warning: If you mess up on step 2, you must redo step 1.
Example: Given that
use Euler’s method with a step size of , estimate when
- Store sto→ the initial values in
XandYalpha 1. Optionally we can also store the step size inH.
- Chain the commands using
:alpha • to updateY,X, and show the new coordinates using{, 2nd (,}2nd ) and comma ❟.
entering the expression
- Press enter until we see
{0.5 ...for .
a few more points
our solution
| purpose | symbol | button(s) |
|---|---|---|
| store | → | sto→ |
| calculation separator | : | alpha • |
| curly braces | {, } | 2nd (, 2nd ) |
| comma | , | ❟ |
| nice fractions | alpha y= 1:n/d | |
| get next point | enter |
The built in euler( is disabled during IB exams.
Store ctrl var the initial values in
xandy. Optionally we can also store the step size inh.Chain the commands using
:from ?!▸ to updatey,x, and show the new coordinates using{,}ctrl )Press enter until we see
{0.5 ...for .
Entering above expressions on TI Nspire CX
Results for Euler's method on TI Nspire CX
| purpose | symbol | button(s) |
|---|---|---|
| store | → | ctrl var |
| calculation separator | : | from ?!▸ |
| curly braces | {, } | ctrl ) |
| comma | , | ❟ |
| nice fractions | from □{□ | |
| get next point | enter |
For this particular method, we need Line or Linear mode. This means more brackets when entering math. This shortcoming makes chaining on Casio not ideal.
Images are from Casio fx-9860GIII. Very similar results on fx-9750GIII and fx-CG50.
In
Run/Mat, set up Shift MENU, change to Line (Linear) mode F2 at the top.
Change to Linear I/O temporarily Store → the initial values in
XandY. Optionally we can also store the step size inH.
initialize X, Y, H on Casio fx-9860GIII Chain the commands using newline Shift EXE to update
Y,X, and show the new coordinates using curly braces Shift ×, Shift ÷ and comma ❟.
Euler's method main step on Casio fx-9860GIII Each result is shown in its own screen as a List. Copy it down.
coordinates after 1 iteration Press EXE twice for the next point. Repeat. Continue until we see
0.5on top for .
final point in Euler's method This is how the main screen should look.
main screen at the end In set up Shift MENU, change back to
MathI/O. when done with Euler’s method.
| purpose | symbol | button(s) |
|---|---|---|
| store | → | → |
| calculation separator | ⤶ | Shift EXE |
| curly braces | {, } | Shift ×, Shift ÷ |
| comma | , | ❟ |
| get next point | EXE |
In ⌂ (home), store Shift EEX , the initial values in
XandY. Optionally we can also store the step size inH.Chain the commands using
;from ALPHA + to updateY,X, and show the new coordinates in one step using curly braces Shift 8 and commaPress Enter until we until we see
{0.5 ...for .
Euler's method using calculation chaining on HP Prime
| purpose | symbol | button(s) |
|---|---|---|
| store | ▶ | Shift EEX |
| calculation separator | ; | ALPHA + |
| curly braces | {, } | Shift 8 |
| comma | , | ❟ |
| get next point | Enter |
recursive ( then )
This method defines two sequences, where u(n+1) depends on u(n) and v(n+1) depends on both u(n) (ie ) and v(n) (ie ). We would create u then v ( then ).
Activate recursive sequence mode/app. Use
u(n+1)to define recursive sequences starting fromn=1.Define
u(1)=0
u(n+1)=u(n)+0.1
v(1)=1
v(n+1)=v(n)+0.1v(n)^2/(1+u(n))Check table.
When the sequences are defined recursively, it does not matter whether we start at n = 0 or n = 1, and just use GDC default.
Example: Given that
use Euler’s method with a step size of , estimate when
On non-CE calculators, follow the instructions below but write (n-1) each time instead of (n).
In mode instead of
FUNCorFUNCTIONchooseSEQ.
use SEQ mode In y=, highlight
SEQ(n+1). SetnMinto1(default). Defineu(n+1),u(1),v(n+1)andv(1).
define the two sequences; both are recursive. In 2nd graph, view the table. Settings can be changed in 2nd window.
table of values To view the graph, see #Euler: coupled DE and use
uvin windowChange back to
FUNCorFUNCTIONmode when done.
| purpose | symbol | button(s) |
|---|---|---|
| sequence mode | SEQ | mode |
| recursive sequence | TYPE:seq(n+1) | use arrow keys |
set n | nMin=1 | use arrow keys |
| sequences | u, v | 2nd 7, 2nd 8 |
| nice fractions | alpha y= 1:n/d | |
| set table | 2nd window | |
| view table | graph |
In
Lists & Spreadsheetapp, enter 0 inA1and 1 inB1. InA2, entera1 + 0.1
initialize the two columns and set formula in A2 While highlighting cell
A2, go to menu3:Data3:Fill. Use down arrow to select the cells to paste the formula. enter to confirm.
highlight A2 while dragging
select cells to paste formula In
B2, enter the expressionDrag B2 down and check the values.
define formula in B2
dragging and checking values
| purpose | symbol | button(s) |
|---|---|---|
| spreadsheet | Lists & Spreadsheet app | |
| drag formula | First term index | menu 3:Data 3:Fill |
| cell | a1 for cell A1 |
Images are from Casio fx-9860GIII. Very similar results on fx-9750GIII and fx-CG50.
In MENU
RECURorRecursionapp, in F3 (TYPE) chooseF2:an+1=Aan+Bn+CDefine the two sequences recursively using the F4 (
n,an) tab.
define the two sequences in an+1 and bn+1 In F5 (
SET), changeENDto show enough terms, and seta0andb0to the initial values.
main screen at the end View table in F6 (
TABL). Scroll for the desired value.
table of values
| purpose | symbol | button(s) |
|---|---|---|
| recursion app | MENU, under RECUR | |
| recursive sequence | F2:an+1=Aan+Bbn+C | F3 (TYPE) |
set n | Start, End | F5 (SET) |
| sequences | an. bn | F4 (Name) |
| set table | F5 (SET) | |
| view table | F6 (TABL) |
In Apps , use
Sequenceapp near the end.Choose
U(N+k)for recursive sequences. DefineU1(n+1)andU2(n+1). Use on-screen buttons as needed.
Define U1(n+1) and U2(n+1) in Sequences app In Num ⊞ to view the table. Settings can be changed in Shift Num ⊞ . Go back to Symb ✗ to change the sequences.
table of values
| purpose | symbol | button(s) |
|---|---|---|
| sequence mode | Apps , Sequence app | |
| recursive sequence | U(N+k) | Symb ✗ , on screen |
set n | Start N | Symb ✗ , on screen |
| sequences | U | touch screen, or ALPHA 4 |
| set table | Shift Num ⊞ | |
| view table | Num ⊞ |
In ⌂ (home), use
Sequencesapp.Add a sequence:
u_n Explicit expression. Setu_n = 0 + 0.1(n-1).Add a sequence:
u_n+1 Recursive first order. Setv_n+1andv1. The variables are from var,Sequences.
define in Sequences app Use arrow keys to move to
Tabletab to view the table and change settings.
viewing the table
Note you can also do recursive for both, it’s just that for purpose of taking screenshots I did explicit and recursive.
| purpose | symbol | button(s) |
|---|---|---|
| sequences mode | ⌂ (home), Sequences app | |
| recursive sequence | u_n+1 Recursive first order | Add a sequence |
set n | First term index | highlight three dots after sequence is defined |
| sequences | u, v | var, sequences |
| set/view table | Table tab |
Second order and coupled DE (AI HL only)
Pretty much the same thing, but we have two derivatives and require two to three variables. Only the recursive method will be explored, as the chaining method needs three to four variables.
Example: M25 P2 TZ2 HL 6 (d), modified
A financial analyst models the change in value of one share, x dollars at time t minutes, after a report is released. She uses the differential equation
This equation can be written as the coupled differential equations
Initially and .
(d) Use Euler’s method with a -interval of to predict the value of when .
“Initially” means . This questions happens to use the same as above, but that is just a coincidence.
Commentary: Question does not usually provide the coupled DE for you. Using question variables, write down the Euler’s method formula with the derivatives substituted in. To avoid data entry errors, write down the correspondence between calculator variables (usually u_n, v_n or a_n, b_n). Also good idea to wrap the derivatives in parentheses ( ).
Tip: Using recursive form above means you never have to worry about your minimum n, and can always use the GDC default, whether that is 0 or 1.
The values
| 0 | 0 | -1 |
| 0.1 | -0.1 | -0.6 |
| … | … | … |
| 1.0 | -0.1718 | 0.1043 |
When , is approx
Tip: ensure your GDC is in radians when seeing trig functions but not the (degree) symbol.
These instructions assume you are familiar with ones from recursive x then y above.
In mode instead of
FUNCorFUNCTIONchooseSEQ. In window, useSEQ(n+1), and type up the above recursive relations.
Check 2nd graph
Table of values
To graph the solution
In window set appropriate
n,XandYvalues.
Table of values In 2nd window, change top line to
vw. For a single (non-coupled DE), chooseuv.
Select the two sequences to plot Graph graph.
DE solution y plotted against x
In In
Lists & Spreadsheetapp, enter the boundary conditions in the first row. Set the time ina2and use menu3:Data3:Filldown arrows to drag down the formula. enter to confirm. We also need to name the columns if you want to view a plot in step 3.
Enter the formulas into
b2andc2and drag the formulas down as well.
To graph the solution in -plane, add a
Data & Statisticstab. Select the columns named earlier.
DE solution y plotted against x
In MENU
RECURorRecursionapp, in F3 (TYPE) chooseF2:an+1=Aan+Bn+C. Define the above sequences using the F4 (n,an) tab.
In F5 (
SET), changeENDto show enough terms, and seta0,b0,c0to the initial values.
View table in F6 (
TABLE). Scroll for the desired value.
Warning: GDC cuts the number at and we need to highlight value to see it is
To graph the solution
In Shift F3, change the
XandYzooms.
Exit. In F3 (
PHASE), selectb-cfor the second and third lists. For single DE, selecta-binstead.
Graph using F6.
In Apps , use
Sequenceapp near the end.Choose
U(N+k)for recursive sequences. DefineU1(n+1)andU2(n+1). Use on-screen buttons as needed.
In Num ⊞ to view the table. Settings can be changed in Shift Num ⊞ . Go back to Symb ✗ to change the sequences.
To graph the solution
In Apps , select
Statistics 2Var.MakeC1 intoU2(X), and C2 intoU3(X), withXmaximum set to upper limit, which here is11.
In Symb ✗ , ensure
S1hasC1andC2beside it.
Plot using Plot . In
Menu,Zoom, chooseB AUTOSCALE.
In ⌂ (home), use
Sequencesapp. Add threes sequence of typeu_n Explicit expression. This allowsu,v,wto be stored in var,Sequences.
Use arrow keys to move to
Tabletab to view the table and change settings.
To graph the solution
In ⌂ (home), use
Regressionapp. HighlightX1then press EXE. SelectFill with a formula. Modify the{k}_k≤10template to add{v_k}toX1andY1. The variablekcan be entered using x,n,t. We want to go up ton=11. Do the same to add{w_k}toY1.
Use arrow keys and select
Graph. By default, the zooms should be set for you.