Maths Olympiad Prep

Library / /219 of 520

Algebra Difficulty 6.3 National olympiad Prove it

4. A4 (KOR) Let a1,a2,,ana_{1}, a_{2}, \ldots, a_{n} be nonnegative real numbers, not all zero. (a) Prove that xna1xn1an1xan=0x^{n}-a_{1} x^{n-1}-\cdots-a_{n-1} x-a_{n}=0 has precisely one positive real root. (b) Let A=j=1naj,B=j=1njajA=\sum_{j=1}^{n} a_{j}, B=\sum_{j=1}^{n} j a_{j}, and let RR be the positive real root of the equation in part (a). Prove that AARB A^{A} \leq R^{B}

Solution

4. Consider the function f(x)=a1x+a2x2++anxn. f(x)=\frac{a_{1}}{x}+\frac{a_{2}}{x^{2}}+\cdots+\frac{a_{n}}{x^{n}} . Since ff is strictly decreasing from ++\infty to 0 on the interval (0,+)(0,+\infty), there exists exactly one R>0R>0 for which f(R)=1f(R)=1. This RR is also the only positive real root of the given polynomial. Since lnx\ln x is a concave function on (0,+)(0,+\infty), Jensen's inequality gives us j=1najA(lnARj)ln(j=1najAARj)=lnf(R)=0. \sum_{j=1}^{n} \frac{a_{j}}{A}\left(\ln \frac{A}{R^{j}}\right) \leq \ln \left(\sum_{j=1}^{n} \frac{a_{j}}{A} \cdot \frac{A}{R^{j}}\right)=\ln f(R)=0 . Therefore j=1naj(lnAjlnR)0\sum_{j=1}^{n} a_{j}(\ln A-j \ln R) \leq 0, which is equivalent to AlnAA \ln A \leq BlnRB \ln R, i.e., AARBA^{A} \leq R^{B}.

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: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.