\[ \frac{dy}{dx} = f(x, y), \quad y(x_0) = y_0 \]
Visual Description:
A hand-drawn graph on a grid illustrating a numerical method (such as Euler's method) for approximating a solution to a differential equation. A Cartesian coordinate system shows an x-axis with labeled points x_0, x_1, x_2, and x_3, and a y-axis with corresponding labeled points y_0, y_1, y_2, and y_3, connected via blue dashed projection lines. A red curve traverses from left to right, representing the 'Approx solution.' Along the curve, red dots mark successive approximation steps connected by tangent slope lines: at (x_0, y_0), a dark green segment is labeled 'slope = f(x_0, y_0)'; at (x_1, y_1), a purple segment is labeled 'slope f(x_1, y_1)'; and at (x_2, y_2), another green segment extends to (x_3, y_3) labeled 'slope f(x_2, y_2)'. The curve continues further to the right through additional points in an undulating shape.
Choose \(h = \text{step size}\) to be small enough
\[ x_n = x_0 + nh \]
\[ y_1 = y_0 + h \, f(x_0, y_0) \]
\[ y_2 = y_1 + h \, f(x_1, y_1) \]
\[ y_3 = y_2 + h \, f(x_2, y_2) \]
Recursively find \(y_n\)
\[ y_n = y_{n-1} + h \, f(x_{n-1}, y_{n-1}) \]