Proving using Mathematical Induction I'm Stuck on the last step, this is proving using mathematical induction, a lecture from my Elementary number theory class.
The question goes to,
Prove that $\sum_{k=1}^n \frac{1}{k^2}=\frac{1}{1^2}+\frac{1}{2^2}+\cdots+\frac{1}{n^2}\le 2-\frac{1}{n}$ whenever $n$ is a positive integer.
This is my Attempt,
Step 1: Base Case ($n=1$)
$$\sum_{k=1}^n \frac{1}{k^2}=\frac{1}{1^2}\le2-\frac{1}{1}$$
$$=1\le1$$, Therefore Base case is true.
Step 2: Induction Hypothesis
Suppose $\sum_{k=1}^n \frac{1}{k^2}=\frac{1}{n^2}\le2-\frac{1}{n}$ is true for $n=m$
$\implies$ $\sum_{k=1}^m \frac{1}{k^2}=\frac{1}{m^2}\le2-\frac{1}{m}$ $\forall m \in \mathbb{N}$
Step 3: $n = m+1$
$\sum_{k=1}^{m+1} \frac{1}{k^2}=\sum_{k=1}^m \frac{1}{k^2}+\frac{1}{(m+1)^2}\le2-\frac{1}{m}+\frac{1}{(m+1)^2}$
I'm Stuck on this step

Starting from the induction hypothesis which is $\sum_{k=1}^m \frac{1}{k^2}\le2-\frac{1}{m}$:- 
Thus:-
$$\sum_{k=1}^m \frac{1}{k^2}\le2-\frac{1}{m}$$
$$\sum_{k=1}^{m+1} \frac{1}{k^2}\le2-\frac{1}{m}+\frac{1}{(m+1)^{2}}$$
As $m\ge1$ so:-
$$\Rightarrow m^2+2m\le m^2+2m+1$$
$$\Rightarrow \frac{m(m+2)}{(m+1)^2}\le 1$$
$$\Rightarrow \frac{(m+1)+1}{(m+1)^2}\le \frac{1}{m}$$
$$\Rightarrow \frac{1}{(m+1)^2} + \frac{1}{m+1}\le \frac{1}{m}$$
$$\Rightarrow \frac{1}{(m+1)^2} -\frac{1}{m}  \le -\frac{1}{m+1}$$
$$\Rightarrow 2-\frac{1}{m}+\frac{1}{(m+1)^2} \le 2 -\frac{1}{m+1}$$
Now making use of the 2nd equation:-
$$\sum_{k=1}^{m+1} \frac{1}{k^2}\le2-\frac{1}{m}+\frac{1}{(m+1)^{2}}\le2 -\frac{1}{m+1}$$
Thus completing the induction step.
