I saw on your other question that you mention <em>y</em> (0) = 0. Let
<em>f(x</em>, <em>y)</em> = <em>x</em> + <em>y</em> ²
Now consider the recurrences in Euler's method,
where <em>h</em> is the step size.
We then approximate <em>y</em> (0.2) in ...
• ... 2 steps for <em>h</em> = 0.1 :
so that <em>y</em> (0.2) ≈ 0.01;
• ... 4 steps for <em>h</em> = 0.05 :
so <em>y</em> (0.2) ≈ 0.015.