Use Theorem 2.1 to find a bound for the number of iterations needed to achieve an approx...

Use Theorem 2.1 to find a bound for the number of iterations needed to achieve an approximation with accuracy 10⁻⁴ to the solution of x³−x−1 = 0 lying in the interval [1, 2]. Find an approximation to the root with this degree of accuracy.

Reference: Theorem 2.1

Suppose that f ∈ C[a, b] and f (a) ·f (b) < 0. The Bisection method generates a sequence

approximating a zero p of f with