Banach's fixed point theorem in $\mathbb{R}$. Number of iterations needed to satisfy an error

Question

Hey I am a quite puzzled by this question

The function $$ f : [-\pi, \pi] \to [-\pi,\pi] ,~~ f(x)= \frac{\sin(x)}{2} $$ is a contraction. Hence the fixed point iteration $x_{k+1}= f(x_{k})$ starting from $x_{0}=\frac{\pi}{2} \in [-\pi , \pi]$ is converging to a fixed point $x^{*}$ How many iterations $k$ are at least necessary s.t. the error is guaranteed to satisfy $|x_{k}-x^{*}| \leq \frac{1}{1024}$

I have been starring at Banach's fixed point theorem for $\mathbb{R}$ which states that the error estimate is $$|x^{*}-x_{n}| \leq \frac{q^{n}}{1-q}|f(x_{0})-x_{0}|$$ where I believe that $q<1$ since it is a part of the contraction mapping definition.

So I can see that you have to find the number of iterations before you get close enough to the fixed point with the bound given in the inequality.

Unfortunately I am not sure even how to start this, any help would be appreciated

Answer 1

We have $q=1/2$, hence you have to determine $n$ such that

$\frac{q^{n}}{1-q}|f(x_{0})-x_{0}| \le \frac{1}{1024}$.