Here is an example showing how to implement Newton's approximation on a TI-83, TI-85, or TI-89 graphing calculator. We will approximate a root of the function f(x) = x2 - 5 with an initial guess of x = 2.The iteration rule for Newton's method is
For this problem, we have x0 = 2 and xn+1 = xn - (xn2 - 5)/(2xn). Here's how we can find the iterates quickly using a [TI-83], [TI-85], or [TI-89]. ![]()
On the TI-83
We first store the iteration rule as the function Y1. To do this we press , clear whatever function happened to be stored there, and enter the iteration rule above.
![]()
Next we press to return to the Home screen. We store the value 2 (our initial guess) into the variable X by pressing . We want to evaluate Y1 (the next iterate) and store the value back into X. To do this, we press , then use the arrow keys to highlight Y-VARS, then press twice to get the variable name Y1 on the home screen. Next we press . When we press , the calculator evaluates Y1 and stores the result in X.
![]()
We now press again and again. Each time, the calculator evaluates the next iterate and stores the result into X
![]()
When the values of the iterates stop changing, we stop and report the answer, correct to nine decimal places.