Very interesting way of explaining MS methods. Two comments: 1.- The Adams-Moulton is solvable using for example a Newton method to find roots of an algebraic implicit equation, it´s interesting to show there exists methods to solve implicit schemes at this point due to their importance in PDEs. 2.- You may improve the accuracy of the Predictor-Corrector iterating between Y* and Y until a tolerance is reached, usually 3 or 4 times so the method may be named P((EC)^m)E. P (predictor, find Y*), then E (evaluate f*), C (correct from Y* to Y, check the difference between them m times or until tolerance is reached) and you got the new Y
