As in Exercises 3.6, for some problems you will find it essential to have a calculator or computer available.† For Problems 1–17, note whether or not is bounded.
Use the fourth-order Runge–Kutta algorithm to approximate the solution to the initial value problem
at x = 2. For a tolerance of use a stopping procedure based on the absolute error.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.