While studying the bisection for the approximation of roots of non-linear equations I was given the following bound for the error:
$|x_n-s| \leq \frac{(b-a)}{2^{n+1}}$
where $x_n$ is the n-th approximation of the root. Now consider the following problem:
Proof that the equation $x^3+4x^2=10$ has a unique solution on [1,2]. Using the bisection method give an approximation of the solution with at least 5 exact decimals.
The problem is I don't know what error should I use, in my class they worked out n from the following expression $\frac{1}{10^5}>\frac{2-1}{2^{n+1}}$.
Now what confuses me comes from the following hypothetical situation
Say the exact result is $1.00001$ and the error is $0.000005$ then between the posible approximations is $1.000005$ (substracting the error) and then I wouldn't have 5 exact decimals.
I need someone to point me out what am I missing here. Is it an error theory concept I'm missing? Should take another bound for the error?
This is known as the "table makers dilemma", where a result is so close to $\frac12$ after the last decimal place wanted that there is no way to decide what the last digit shown should be.
Look it up - Google returns a number of quite relevant links.