I wish to determine the limit of $a_n$, where we recursively define:
$$a_n= a_{n-1} \left(1+ \frac{1}{\sqrt n}\right)$$ where $a_0=1$
I already noticed it is increasing, because $$a_n - a_{n-1}= \frac{1}{\sqrt{n}}a_{n-1}>0 $$ Since all terms are strictly positive. (alternatively, we could form a better argument via induction).
edit:
Base case: $a_1 = 2 > 1 = a_0$.
Hypothesis: $a_k > a_{k-1}$
Step: $a _ {k+1}= a_{k} \left(1+ \frac{1}{\sqrt n}\right)>a_{k-1} \left(1+ \frac{1}{\sqrt n}\right)=a_k $ Therefore $a_n >a_{n-1}$ for all $n$ and the sequence is increasing.
I plotted some terms and this seems to grow exponentially, how would I prove it diverges? I think I need to show it is unbounded.I tried the ratio test for sequences but this is inconclusive as the ratio tends to $1$.
Further to my comment, starting with $$a_n = a_{n-1}\left(1+\frac{1}{\sqrt{n}}\right)=a_{n-2}\left(1+\frac{1}{\sqrt{n-1}}\right)\left(1+\frac{1}{\sqrt{n}}\right)=\\ a_0\prod\limits_{k=1}^n\left(1+\frac{1}{\sqrt{k}}\right)\geq \left(1+\frac{1}{\sqrt{n}}\right)^n= \left(\left(1+\frac{1}{\sqrt{n}}\right)^{\sqrt{n}}\right)^{\sqrt{n}} \geq ...$$ and applying Bernoulli's inequality $$...\geq \left(1+\frac{\sqrt{n}}{\sqrt{n}}\right)^{\sqrt{n}}=2^{\sqrt{n}}$$ As a result $$a_n \geq 2^{\sqrt{n}}$$ and the result follows, i.e. the sequence is unbounded and diverges.