Prove that for all m > n $\ge$ 1,
$ \vert x_m - x_n\vert \le \frac{K^{n-1}}{1-K}\vert x_2-x_1\vert $
Where K is a contraction factor of f, such that K $\in$ [0,1) and $\vert f(x)-f(y) \vert \le K\vert x-y \vert $
$(x_n)$ is the sequence defined as $x_1 = \alpha \in R$ and $x_n = f(x_{n-1}) $ for all $n\ge2$
I have already shown that $\forall n \ge 1$, $\vert x_{n+1}-x_n\vert \le K^{n-1}\vert x_2-x_1 \vert$,
so that can be used without proof.
I tried using induction by showing m=n+1 holds, assuming m=n+k holds, but couldn't show that m=n+k+1 holds.
I don't know if you're supposed to use induction but that's the only method I could think of.