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

IMC / 2015 / Problems / Day 2, P6

IMC 2015 · Day 2 · P6

easy

Prove that n=11n(n+1)<2.\sum_{n=1}^{\infty} \frac{1}{\sqrt{n(n+1)}} < 2. (Proposed by Ivan Krijan, University of Zagreb)

Solution (official)

We prove that 1n(n+1)<2n2n+1.(1)\tag{1} \frac{1}{\sqrt{n(n+1)}} < \frac{2}{\sqrt{n}} - \frac{2}{\sqrt{n+1}}. Multiplying by n(n+1)\sqrt{n(n+1)}, the inequality (1) is equivalent with 1<2(n+1)2n(n+1)2n(n+1)<n+(n+1)\begin{gather*} 1 < 2(n+1) - 2 \sqrt{n(n+1)} \\ 2 \sqrt{n(n+1)} < n + (n+1) \end{gather*} which is true by the AM-GM inequality.

Applying (1) to the terms in the left-hand side, n=11n(n+1)<n=1(2n2n+1)=2.\sum_{n=1}^{\infty} \frac{1}{\sqrt{n(n+1)}} < \sum_{n=1}^{\infty} \left( \frac{2}{\sqrt{n}} - \frac{2}{\sqrt{n+1}} \right) = 2.

How the field did

contestants scored
318
average (of 10)
6.75
solved (≥ 80%)
63.8%
near-0 (≤ 10%)
25.2%
discrimination
0.44

Score distribution (field cohort)

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

Similar problems

IMC 2016 · Day 2 · P6easyavg 7.0/10 · solved 56% · near-0 10% · disc 0.42
IMC 2018 · Day 1 · P1easyavg 9.2/10 · solved 89% · near-0 6% · disc 0.29
IMC 2024 · Day 2 · P8mediumavg 4.8/10 · solved 34% · near-0 33% · disc 0.66
IMC 2000 · Day 1 · P4hardavg 4.7/10 · solved 22% · near-0 26% · disc 0.62