# Error bound and its iteration for a false postion method

In the bisection method if we set an error bound $\delta$ , a positive integer N to be used as a limit on the number of iterations performed is $$N = floor \Big[{{ln(b-a)-ln\delta}\over {ln(2)}}\Big]$$ here floor means round down, and the estimated root lies in interval [a,b].

Now if we set an error bound $\delta$ and use the false postion method, then what is the number of iteration N now?

-