Maths Olympiad Prep

Library / /452 of 520

Algebra Difficulty 7.5 National olympiad, round 2 Prove it

Let a1,a2...an a_{1}, a_{2}...a_{n} be non-negative reals, not all zero. Show that that
(a) The polynomial p(x)\equalxn\minusa1xn\minus1\plus...\minusan\minus1x\minusan p(x) \equal{} x^{n} \minus{} a_{1}x^{n \minus{} 1} \plus{} ... \minus{} a_{n \minus{} 1}x \minus{} a_{n} has preceisely 1 positive real root R R.
(b) let A\equali\equal1nai A \equal{} \sum_{i \equal{} 1}^n a_{i} and B\equali\equal1niai B \equal{} \sum_{i \equal{} 1}^n ia_{i}. Show that AARB A^{A} \leq R^{B}.

Solution

### Part (a)
1. Consider the polynomial p(x)=xna1xn1+a2xn2an1xan p(x) = x^n - a_1 x^{n-1} + a_2 x^{n-2} - \cdots - a_{n-1} x - a_n .
2. Define the function f(x)=i=1naixi f(x) = \sum_{i=1}^n \frac{a_i}{x^i} . Note that f(x) f(x) is a sum of terms of the form aixi \frac{a_i}{x^i} , where ai0 a_i \geq 0 and not all ai a_i are zero.
3. Since ai0 a_i \geq 0 and x>0 x > 0 , each term aixi \frac{a_i}{x^i} is positive and f(x) f(x) is a strictly decreasing function for x>0 x > 0 .
4. As x0+ x \to 0^+ , f(x) f(x) \to \infty because the terms aixi \frac{a_i}{x^i} dominate.
5. As x x \to \infty , f(x)0 f(x) \to 0 because each term aixi \frac{a_i}{x^i} approaches zero.
6. By the Intermediate Value Theorem, since f(x) f(x) is continuous and strictly decreasing from \infty to 0 0 , there exists a unique R>0 R > 0 such that f(R)=1 f(R) = 1 .

Thus, the polynomial p(x) p(x) has precisely one positive real root R R .

### Part (b)
1. By Jensen's inequality for the convex function lnx \ln x , we have:
i=1naiAln(ARi)ln(i=1naiAARi) \sum_{i=1}^n \frac{a_i}{A} \ln \left( \frac{A}{R^i} \right) \leq \ln \left( \sum_{i=1}^n \frac{a_i}{A} \cdot \frac{A}{R^i} \right)
2. Simplifying the right-hand side, we get:
ln(i=1naiRi)=lnf(R)=ln1=0 \ln \left( \sum_{i=1}^n \frac{a_i}{R^i} \right) = \ln f(R) = \ln 1 = 0
3. Therefore, we have:
i=1naiAln(ARi)0 \sum_{i=1}^n \frac{a_i}{A} \ln \left( \frac{A}{R^i} \right) \leq 0
4. Expanding the left-hand side, we get:
i=1naiA(lnAilnR)=lnAi=1naiAlnRi=1niaiA \sum_{i=1}^n \frac{a_i}{A} \left( \ln A - i \ln R \right) = \ln A \sum_{i=1}^n \frac{a_i}{A} - \ln R \sum_{i=1}^n \frac{ia_i}{A}
5. Since i=1naiA=1 \sum_{i=1}^n \frac{a_i}{A} = 1 , this simplifies to:
lnAlnRAi=1niai0 \ln A - \frac{\ln R}{A} \sum_{i=1}^n ia_i \leq 0
6. Let B=i=1niai B = \sum_{i=1}^n ia_i . Then:
lnABlnRA \ln A \leq \frac{B \ln R}{A}
7. Multiplying both sides by A A , we get:
AlnABlnR A \ln A \leq B \ln R
8. Exponentiating both sides, we obtain:
AARB A^A \leq R^B

The final answer is AARB \boxed{ A^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.