Prove that for all n∈N the inequality (n∑k=1(2k−1)k+1k)(n∑k=1(2k−1)kk+1)≤98n4
holds.
My work. I proved this inequality, but my proof is ugly (it is necessary to check by brute force whether the inequality holds for n=1,2,3,...,15). I hope that there is nice proof of this inequality. Michael Rozenberg wrote a very nice solution to a similar problem ( Prove the inequality n∑k=1k+1k⋅n∑k=1kk+1≤98n2 ). I think this inequality has a similar proof, but I can’t prove in a similar way. I will write as I proved the inequality. Let Sn=n∑k=11k. Then n∑k=1(2k−1)k+1k=n2+2n−Sn
Answer
We can use also the Cassel's inequality:
Let a, b and w be sequences of n positive numbers such that $1
for any k. Prove that:
n∑k=1wka2kn∑k=1wkb2k≤(M+m)24Mm(n∑k=1wkakbk)2.
This inequality was here:
G.S. WATSON, Serial Correlation in Regression Analysis, Ph.D. Thesis, Dept. of Experimental
Statistics, North Carolina State College, Raleigh; Univ. of North Carolina, Mimograph Ser., No.
49, 1951, appendix 1.
In our case wk=2k−1, ak=√k+1k, bk=√kk+1, M=2 and m=1, which gives:
n∑k=1(2k−1)k+1kn∑k=1(2k−1)kk+1≤(2+1)24⋅2⋅1(n∑k=1(2k−1))2=9n48.
No comments:
Post a Comment