@Hari_Shankar sir please see this
It can be done by using AM GM i think...
@Abhishek_2021_2 I would be happy to know how did you use AM-GM inequality to prove it
One simple method that I can think of is the Cauchy Schwartz inequality. You just have to use it taking the first summation as a and the second summation as b
sir nt getting by cs inequality will get n^2..
I think he mean by AM-HM inequality
plz share solution
I am not getting that bound . I will again try tomorrow , if I got , I will share hint
Have you tried Chebyshev inequality?
ya sir didnt get..
see this question
Probably this should give the answer, if not do tell me!
the answer 9/8 n^2 i tried this way didnt get plz see
Oh ok, didn't read above chats! Lemme check then
I'm unable to come up with something right now, will surely post if something clicks!
Best way to do this kind of problem is apply PMI
how you get 9/8 on solving sir..
It's PMI for n=p any no. The inequality is correct
sir but the realtion question is same we have to prove 9/8 this term nt getting any way approximation can be done in all the above inequality as suggested by hari shankar sir me and azimuddin sir all are giving ans n^2.why only 9/8 coming thats my question sir..thanks for your method..
See if it's less than n² then it will also be less than 9/8n²