Prove ${a_n} = \lim\limits_{n \to \infty } \sum\nolimits_{k \ge 1} {{1 \over {{k^2}}}} $ Converges by using Cauchy's criteria.
What I did:
Let $n, m=n+k \in \mathbb{N}$.
$$\left| {{a_m} - {a_n}} \right| = \left| {{a_{n + k}} - {a_n}} \right| = \left| {\sum\limits_{l = n + 1}^{n + k} {{1 \over {{l^2}}}} } \right| \le k \cdot {1 \over {{{(n + 1)}^2}}} \le {k \over n}$$
At this phase I need to choose $N\in\mathbb{N}$ such that $\forall m,n>N: \left| {{a_m} - {a_n}} \right| < \varepsilon$
The problem is that $k\over n$ depends on $k$. How to "correct" this?
Hint: $$ \begin{align} \sum_{k=m+1}^n\frac1{k^2} &\le\sum_{k=m+1}^n\frac1{k(k-1)}\\ &=\sum_{k=m+1}^n\left(\frac1{k-1}-\frac1k\right)\\ &=\frac1m-\frac1n \end{align} $$