Let $(a_n)$ be a sequence s.t $$a_{1} > 0 \land a_{n+1}=a_{n}+\frac{1}{a_{n}}$$
Prove that $a_{n}$ is unbounded.
Proof:
Consider $a_{n+1}−a_{n}$:
$a_{n+1} - a_{n} = a_{n} + \frac{1}{a_{n}} - a_{n} = \frac{1}{a_{n}}$.
This is greater than $0$. Thus, $a_{n}$ is increasing.
It was proved that $a_{n}$ is increasing. Assume that it is bounded. Then it would follow that $a_{n}$ is convergent to a real number $L>0$. But taking $n\to\infty$ into the recurrence relation gives $$L+\frac{1}{L} =L$$ which is a contradiction. Therefore $a_{n}$ is unbounded
I found this on the site but I don't get why it is unbounded. Could someone plz explain?
In your case $a$ is unbounded because if $a$ is bounded then there is a limit of $a$.
It gives a contradiction.
Thus, the assuming was wrong, which says that $a$ is unbounded.
Also we can use the following reasoning.
Since $$a_{n+1}^2=a_n^2+2+\frac{1}{a_n^2},$$ For all $n\geq2$ we obtain $$a_n^2=2(n-1)+a_1^2+\sum_{k=1}^{n-1}\frac{1}{a_k^2}>2(n-1),$$ which gives $a_n>\sqrt{2(n-1)}$ and we are done!