MathCastle
Differential EquationsEasyNumerical Methods: Euler to Runge–Kutta

Numerical Methods: Euler to Runge–Kutta · Easy problem

Apply one step of the backward Euler method y1=y0+h f(t1,y1)y_1 = y_0 + h\,f(t_1, y_1) with h=1h = 1 to y′=2−yy' = 2 - y, y(0)=0y(0) = 0. What is y1y_1?