Unofficial archive — problems, solutions & results © IMC, reproduced with permission.

IMC / 2016 / Problems / Day 2, P6

IMC 2016 · Day 2 · P6

easy

Let (x1,x2,)(x_1, x_2, \dots) be a sequence of positive real numbers satisfying n=1xn2n1=1\displaystyle\sum_{n=1}^{\infty} \frac{x_n}{2n-1} = 1. Prove that k=1n=1kxnk22.\sum_{k=1}^{\infty} \sum_{n=1}^{k} \frac{x_n}{k^2} \le 2. (Proposed by Gerhard J. Woeginger, The Netherlands)

Solution (official)

By interchanging the sums, k=1n=1kxnk2=1nkxnk2=n=1xn(k=n1k2).\sum_{k=1}^{\infty} \sum_{n=1}^{k} \frac{x_n}{k^2} = \sum_{1 \le n \le k} \frac{x_n}{k^2} = \sum_{n=1}^{\infty} x_n \left( \sum_{k=n}^{\infty} \frac{1}{k^2} \right). Then we use the upper bound k=n1k2k=n1k214=k=n(1k121k+12)=1n12\sum_{k=n}^{\infty} \frac{1}{k^2} \le \sum_{k=n}^{\infty} \frac{1}{k^2 - \frac14} = \sum_{k=n}^{\infty} \left( \frac{1}{k - \frac12} - \frac{1}{k + \frac12} \right) = \frac{1}{n - \frac12} and get k=1n=1kxnk2=n=1xn(k=n1k2)<n=1xn1n12=2n=1xn2n1=2.\sum_{k=1}^{\infty} \sum_{n=1}^{k} \frac{x_n}{k^2} = \sum_{n=1}^{\infty} x_n \left( \sum_{k=n}^{\infty} \frac{1}{k^2} \right) < \sum_{n=1}^{\infty} x_n \cdot \frac{1}{n - \frac12} = 2 \sum_{n=1}^{\infty} \frac{x_n}{2n-1} = 2.

How the field did

contestants scored
314
average (of 10)
6.98
solved (≥ 80%)
56.4%
near-0 (≤ 10%)
9.9%
discrimination
0.42

Score distribution (field cohort)

Computed on contestants with a meaningful total (field cohort); discrimination is the corrected item–total correlation.

Similar problems

IMC 2015 · Day 2 · P6easyavg 6.7/10 · solved 64% · near-0 25% · disc 0.44
IMC 2024 · Day 2 · P8mediumavg 4.8/10 · solved 34% · near-0 33% · disc 0.66
IMC 2018 · Day 1 · P1easyavg 9.2/10 · solved 89% · near-0 6% · disc 0.29
IMC 2000 · Day 1 · P4hardavg 4.7/10 · solved 22% · near-0 26% · disc 0.62