Maths Olympiad Prep

Library / /86 of 120

Algebra Difficulty 5.8 AIME, harder Prove it Saudi Arabia

Let n2n \geq 2 be a positive integer and let xnx_{n} be a positive real root to the equation x(x+1)(x+n)=1x(x+1) \ldots(x+n)=1. Prove that
xn<1n!Hn x_{n}<\frac{1}{\sqrt{n!H_{n}}}
where Hn=1+12++1nH_{n}=1+\frac{1}{2}+\ldots+\frac{1}{n}.

Solution

Because xnx_{n} satisfies the equation we have xn2Sn1<1x_{n}^{2} \cdot S_{n-1}< 1, where Sn1S_{n-1} is the n1n-1 symmetric sum of 1,2,,n1,2, \ldots, n. We can write
Sn1=n!(1+12++1n)=n!Hn S_{n-1}=n!\left(1+\frac{1}{2}+\ldots+\frac{1}{n}\right)=n!\cdot H_{n}
and the above inequality is equivalent to xn2<1n!Hnx_{n}^{2}<\frac{1}{n!H_{n}}, hence xn<1n!Hnx_{n}<\frac{1}{\sqrt{n!H_{n}}}.

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 and solution reproduced as published; topic and difficulty added by this site.