Let $x_0=5,x_1=10,$ and for all integers $n\ge2$ let $x_n=\frac12\left(x_{n-1}+\frac8{x_{n-2}}\right).$ By induction, we have $\forall m\in\mathbb Z_{\ge0}\enspace x_m>0,$ so we can avoid division by $0$ and the sequence is well-defined.
According to a Math GRE practice problem, the limit exists. How can we prove that? Note that, if we assume the limit exists, then we can show it equals $\sqrt8,$ but finding the value of the limit is not my goal here.
My work: We can compute $x_2=5.8,x_3=3.3,$ which are strictly between $4/3$ and $6,$ and then, assuming an inductive hypothesis, for all integers $n\ge4$ we have $4/3<x_{n-1}<6$ and $4/3<8/x_{n-2}<6,$ so that $4/3<x_n<6.$ We can probably compute more values of $x_n$ to get tighter bounds, but I don't see how to actually show convergence.