A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
The paper proves convergence for three uniquely defined recursive sequences, namely, arithmetico-geometric sequence, the Newton-Raphson recursive sequence, and the nested/composite recursive sequence. The three main hurdles for this prove processes are boundedness, monotonicity, and convergence. Oftentimes, these processes lie in the predominant use of prove by mathematical induction and also require some bit of creativity and inspiration drawn from the convergence monotone theorem. However,doi:10.30538/oms2021.0145 fatcat:xiwfcgl4gbdyhfuspqxcztp7l4