Determine the smallest real constant c such that k=1∑n(k1j=1∑kxj)2≤ck=1∑nxk2, for all positive integers n and all positive real numbers x1,…,xn.
Solution
The best constant is c=4. We first show that, if n is a positive integer and x1,…,xn are positive real numbers, then k=1∑n(k1j=1∑kxj)2+n2(k=1∑nxk)2<4k=1∑nxk2, so c≤4. To prove the above inequality, proceed by induction on n. The base case, n=1, is clear. For the induction step, let xˉk=(x1+⋯+xk)/k, k≥1, and notice that it is sufficient to show that (2n+3)xˉn+12−2nxˉn2<4xn+12. Since xn+1=(n+1)xˉn+1−nxˉn, this is equivalent to 2n(2n+1)xˉn2−8n(n+1)xˉnxˉn+1+(4n2+6n+1)xˉn+12>0. The left-hand member is a quadratic form in xˉn and xˉn+1 whose discriminant is −2n and the inequality follows.
To show c≥4, we prove that k=1∑n(k1j=1∑kj1)2>4k=1∑nk1−24. Divergence of the harmonic series settles the case. Write 1/j>2(j+1−j), to obtain (k1j=1∑kj1)2>k24(k+1−1)2>k4(1−k2)=k4−kk8. Finally, notice that 1/(2kk)<1/k−1−1/k, k≥2, to get k=1∑nkk1≤3−n2<3, and deduce thereby the desired inequality.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.
Source: MathNet,
licensed CC-BY-4.0.
Statement reproduced verbatim; metadata (topic, difficulty) added by this project.