Proving divergence of a sequence by proving the sequence is increasing. We define a sequence recursively by $$a_{n+1}=\frac{1}{4}({a_n}^2+a_n+2)~~~~~~~(a_1=3)$$
By showing $a_n$ is increasing prove that $a_n$ does not converge.
Not sure how to do this one. I tried showing that $a_{n+1}-a_n>0$ but couldn't get it to work also not sure how this would be used to imply it doesn't converge. (Although I think you can just state it is unbounded so eventually it will be bigger than any limit you could imagine)
Thanks

$\begin{array}\\
a_{n+1}
&=\frac{1}{4}({a_n}^2+a_n+2)\\
&=\frac{1}{16}(4{a_n}^2+4a_n+8)\\
&=\frac{1}{16}(4{a_n}^2+4a_n+1+7)\\
&=\frac{1}{16}((2{a_n}+1)^2+7)\\
\end{array}
$
Therefore
$2a_{n+1}+1
=\frac{1}{8}((2{a_n}+1)^2+7)+1
=\frac{1}{8}((2{a_n}+1)^2+15)
$.
Letting
$b_n
=2a_n+1
$,
$b_{n+1}
=\frac{1}{8}(b_n^2+15)
$.
Since $b_1
=2a_1+1
=7
$,
$b_2
=\frac{49+15}{8}
=8
$,
$b_3
=\frac{64+15}{8}
=\frac{79}{8}
> 9
$.
If $b_n
\ge 8+k
$
where $k \ge 1$
(which is true for
$n=3$),
then
$b_{n+1}
=\frac{1}{8}(b_n(8+k)+15)
=\frac{1}{8}(8 b_n+kb_n+15)
=b_n+\frac{1}{8}(kb_n+15)
=b_n+\frac{1}{8}(k(8+k)+15)
$
so
$b_{n+1}-b_n
=\frac{1}{8}(k(8+k)+15)
= k+\frac{1}{8}(k^2+15)
\ge k+2
$.
Therefore
$b_n$
is unbounded
and strictly increasing
and so is 
$a_n$.
