Suppose we have a polynomial f(x) = 4 - x'. We want to find the value of x that makes f(x) = 0. (This value, call it t, is the cube root of 4. In fact we can use the bisection method to find the n" root of a number.) If we know that the function f(x) is definitely 0 somewhere inside an interval [/, r], and that f(x) is strictly increasing (or decreasing) over that interval, then the bisection method is a fast way of finding the root of f(x) to within a good level of accuracy