Use induction to prove \(\sum_{k=1}^n \dfrac{1}{k^2}\leq 2-\dfrac{1}{n}\) for all positive integers n. Please, help
HS: \(\sum_{k=1}^n \dfrac{1}{k^2}\leq 2 - \dfrac{1}{n}\) Induction step \(\sum_{k=1}^{n+1} \dfrac{1}{k^2}= \sum_{k=1}^n \dfrac{1}{k^2}+\dfrac{1}{(n+1)^2}\leq 2-\dfrac{1}{(n+1)^2}\)
oh, the last one is not ^2 \(\sum_{k=1}^{n+1} \dfrac{1}{k^2}= \sum_{k=1}^n \dfrac{1}{k^2}+\dfrac{1}{(n+1)^2}\leq 2-\dfrac{1}{(n+1)}\)
This is my attempt: the first part of the sum is \(\leq 2 - (1/n)\) , hence the LHS is \(\leq 2 -(1/n) + (1/n+1)^2\)
So, we need prove \(2-\dfrac{1}{n} +\dfrac{1}{(n+1)^2}\leq 2- \dfrac{1}{n+1}\)
Then I stuck
clear the denominators and simplify
it simplifies nicely and you end up with \(1\ge 0\)
Yes, I did, but those are denominators, hence when I take reciprocal, the signs switch around.
oh, let me try again. :)
\(2-\dfrac{1}{n} +\dfrac{1}{(n+1)^2}\leq 2- \dfrac{1}{n+1}\) \(\iff\) \(\dfrac{1}{n} -\dfrac{1}{(n+1)^2}\ge \dfrac{1}{n+1}\) \(\iff\) \((n+1)^2-n\ge n(n+1)\)
Thanks a lot.
I got it. Thank you so much
np
Join our real-time social learning platform and learn together with your friends!