aimnova.
DashboardMy LearningPaper MasteryStudy Plan

Aimnova site navigation

Stay in the loop

Get the latest study resources and updates

New features, study tips and exam insights — straight to your inbox.

IB Diploma

  • IB Past Papers
  • IB Study Notes
  • IB Question Bank
  • IB Mock Exams
  • IB Revision

IB Subjects

  • IB Math AA
  • IB Math AI
  • IB Economics
  • IB Business Management
  • IB Physics
  • IB Biology
  • View all IB subjects→

IB Past Papers

  • IB Math AA HL Past Papers
  • IB Math AA SL Past Papers
  • IB Math AI HL Past Papers
  • IB Math AI SL Past Papers
  • IB Economics HL Past Papers
  • IB Economics SL Past Papers
  • IB ESS Past Papers
  • View all past papers→

Study Resources

  • Study Notes
  • Question Bank
  • Mock Exams
  • Flashcards
  • Revision Guide
  • Exam Skills
  • Command Terms
  • Grade Calculator
  • Exam Timetable 2026

Aimnova

  • Features
  • Pricing
  • For Schools
  • For Parents
  • About Us
  • Blog
  • Contact
aimnova.

AI-powered study platform for smarter revision, past-paper analysis and examiner-style feedback.

TermsPrivacyCookies·© 2026 Aimnova. All rights reserved.8afc4e3

Aimnova is not affiliated with or endorsed by the International Baccalaureate Organization (IB).

NotesMath AI HLTopic 5.16Euler's method (1st order)
Back to Math AI HL Topics
5.16.15 min read

Euler's method (1st order) (Math AI HL)

IB Mathematics: Applications and Interpretation • Unit 5

Smart study tools

Turn reading into results

Move beyond passive notes. Answer real exam questions, get AI feedback, and build the skills that earn top marks.

Get Started Free

Contents

  • The Euler recurrence — and counting the steps
  • Working the recurrence on the GDC — and why it's only an estimate
Picture: walking along the gradient in tiny straight steps: A differential equation dy/dx = f(x, y) tells you the gradient at every point, but not the curve itself. Imagine standing on the solution curve at a known point (x₀, y₀).

You cannot see the whole curve, so you walk forward in a tiny straight step of width h, following the gradient you can measure right now. Then you re-measure the gradient at the new point and step again.

Each step is a short straight line, so the path is only approximate — but with small enough steps it hugs the true curve closely. That is Euler's method.
The Euler recurrence: new y = old y + step width × gradient there; x advances by h each time.
Count the steps — this is where marks are lost: To reach a target x-value from x₀ in steps of width h you need

number of steps = (target − x₀) ÷ h.

For example, going from x = 1 to x = 2 with h = 0.25 is (2 − 1)/0.25 = 4 steps, not one. Always work this out first, then build a table with that many rows after the starting row.

IB-style question — cooling metal block

A metal block cools so that its temperature T (°C) satisfies dT/dx = −0.4(T − 25), where x is the time in minutes. At x = 1 minute the block is at 85 °C.

Use Euler's method with step length h = 0.25 to estimate the temperature at x = 2 minutes.

Step by step

  1. First count the steps: from x = 1 to x = 2 with h = 0.25.
  2. Write the recurrence for this DE, where f(x, T) = −0.4(T − 25).
  3. Step 1, from (1, 85). Gradient = −0.4(85 − 25) = −24.
  4. Step 2, from (1.25, 79). Gradient = −0.4(79 − 25) = −21.6.
  5. Step 3, from (1.5, 73.6). Gradient = −0.4(73.6 − 25) = −19.44.
  6. Step 4, from (1.75, 68.74). Gradient = −0.4(68.74 − 25) = −17.496.

Final answer

After 4 steps we reach x = 2, giving T ≈ 64.4 °C. The block is approximately 64.4 °C after 2 minutes. This is an estimate — Euler treats each step as a straight line, so it slightly misses the true cooling curve.

Lay it out as a table: Set out columns n, xₙ, yₙ and f(xₙ, yₙ). Fill the gradient column first, then use it to get the next yₙ. The number of rows below the starting row equals your step count — re-count at the end as a check.

Free preview

This is the free notes preview

You're reading the free notes. Aimnova Pro unlocks the full study experience — and you can try it with your first topic free to keep:

  • FlashcardsLock in vocabulary and key terms with spaced repetition.
  • Practice questionsAnswer exam-style questions and get instant AI marking.
  • Mock exams & past-paper vaultSit full mocks and see exactly how examiners award marks.
  • Personalised study planA daily plan built around your exam date and weak areas.
Start Studying Free Full access to Aimnova Pro · cancel anytime
One gradient, one step, repeat: Every Euler step is the same three moves: read the gradient f(xₙ, yₙ) at where you are, take a step yₙ₊₁ = yₙ + h·(that gradient), and advance x by h.

On the GDC you can store this as a recursive sequence (or just type each line into a table), so the calculator grinds out the rows — a GDC is allowed on every AI paper, and this is the intended method.

Because each step follows the starting gradient of the step (not the average), Euler under- or over-estimates depending on how the curve bends: for a curve that is concave up it tends to undershoot, for concave down it tends to overshoot.
Apply this repeatedly; smaller h ⇒ more steps ⇒ a more accurate estimate.

IB-style question — charging a capacitor

A capacitor charges so that the charge Q (coulombs) satisfies dQ/dt = (6 − Q)/2, where t is the time in seconds. At t = 0 the capacitor is uncharged, so Q = 0.

Use Euler's method with step length h = 0.5 to estimate the charge at t = 2 seconds.

Step by step

  1. Count the steps: from t = 0 to t = 2 with h = 0.5.
  2. The recurrence, with f(t, Q) = (6 − Q)/2.
  3. Step 1, from (0, 0). Gradient = (6 − 0)/2 = 3.
  4. Step 2, from (0.5, 1.5). Gradient = (6 − 1.5)/2 = 2.25.
  5. Step 3, from (1, 2.625). Gradient = (6 − 2.625)/2 = 1.6875.
  6. Step 4, from (1.5, 3.46875). Gradient = (6 − 3.46875)/2 = 1.265625.

Final answer

After 4 steps, Q ≈ 4.10 coulombs at t = 2 seconds. The true charge curve flattens towards 6 C; because it is concave down, Euler slightly OVERSHOOTS, so 4.10 C is an over-estimate of the real value.

Use the previous row's value, not the rounded one: Carry full accuracy between rows — feed the unrounded yₙ into the next step and only round the FINAL answer. Rounding every row makes the error grow. On the GDC the stored sequence value already keeps full precision for you.

IB Exam Questions on Euler's method (1st order)

Practice with IB-style questions filtered to Topic 5.16.1. Get instant AI feedback on every answer.

Practice Topic 5.16.1 QuestionsBrowse All Math AI HL Topics

How Euler's method (1st order) Appears in IB Exams

Examiners use specific command terms when asking about this topic. Here's what to expect:

Define

Give the precise meaning of key terms related to Euler's method (1st order).

AO1
Describe

Give a detailed account of processes or features in Euler's method (1st order).

AO2
Explain

Give reasons WHY — cause and effect within Euler's method (1st order).

AO3
Evaluate

Weigh strengths AND limitations of approaches in Euler's method (1st order).

AO3
Discuss

Present arguments FOR and AGAINST with a balanced conclusion.

AO3

See the full IB Command Terms guide →

Related Math AI HL Topics

Continue learning with these related topics from the same unit:

5.1.1Introduction to Limits
5.10.1The second derivative & concavity
5.11.1Integration techniques
5.12.1Area under and between curves
View all Math AI HL topics

Improve your exam technique

Command terms, paper structure, and mark-scheme tips for Math AI HL

Previous
5.15.1Slope fields
Next
Phase portraits of coupled systems5.17.1

11 practice questions on Euler's method (1st order)

Students who practiced this topic on Aimnova scored 82% on average. Try free practice questions and get instant AI feedback.

Try 3 Free QuestionsView All Math AI HL Topics