My question concerns the following proof:
Prove $\sum_{k=1}^n 1/k^2\le2-1/n$ for every $n$.
Proof. Clearly this holds for $n=1$. Assume it holds for some $n\ge1$. Then $\sum_{k=1}^{n+1}1/k^2\le2-1/n+1/(n+1)^2=2-\frac{(n+1)^2-n}{n(n+1)^2}\le2-1/(n+1)$. The proof is complete.
So, my question is how does one immediately see that $$2-\frac{(n+1)^2-n}{n(n+1)^2}\le2-\frac1{n+1}\ ?$$ Is there a quick logical way to surmise that the expression on the left must be less than or equal to the expression on the right or is there a bit more exploration required to see that this is true? (i.e. plugging in a few values, etc.)
This is equivalent to $$\frac{(n+1)^2-n}{n(n+1)^2} \ge \frac{1}{n+1}$$ Since $n+1>0$, we can cancel it: $$\frac{(n+1)^2-n}{n(n+1)} \ge 1$$ Since $n(n+1)>0$, this is equivalent to $$(n+1)^2-n \ge n(n+1)$$ which you can see to be true by expanding both sides.