Maths Olympiad Prep

Library / /14 of 25

Geometry Difficulty 6.4 National olympiad Prove it Russia

Let P(x)P(x) be a polynomial of degree n2n \ge 2 with nonnegative coefficients. Let aa, bb, and cc be the side lengths of some triangle. Prove that the numbers P(a)n\sqrt[n]{P(a)}, P(b)n\sqrt[n]{P(b)}, and P(c)n\sqrt[n]{P(c)} are also the side lengths of some triangle.

Пусть P(x)P(x) — многочлен степени n2n \ge 2 с неотрицательными коэффициентами. Пусть aa, bb, cc — длины сторон некоторого треугольника. Докажите, что числа P(a)n\sqrt[n]{P(a)}, P(b)n\sqrt[n]{P(b)}, P(c)n\sqrt[n]{P(c)} также являются длинами сторон некоторого треугольника.

Solution

Assume that abca \ge b \ge c. Set G(x)=P(x)/xnG(x) = P(x)/x^n and notice that G(a)G(b)G(c)G(a) \le G(b) \le G(c).

Let, without loss of generality, abca \ge b \ge c; these three positive numbers are the side lengths of a triangle if and only if a<b+ca < b + c. Since the coefficients of P(x)P(x) are nonnegative, we have P(a)P(b)P(c)>0P(a) \ge P(b) \ge P(c) > 0; thus, we need to check that P(a)n<P(b)n+P(c)n\sqrt[n]{P(a)} < \sqrt[n]{P(b)} + \sqrt[n]{P(c)}.

Let P(x)=pnxn+pn1xn1++p0P(x) = p_n x^n + p_{n-1} x^{n-1} + \dots + p_0. Denote G(x)=P(x)/xnG(x) = P(x)/x^n. Note that
G(a)=pn+pn1a++p0anpn+pn1b++p0bn=G(b)G(a) = p_n + \frac{p_{n-1}}{a} + \dots + \frac{p_0}{a^n} \le p_n + \frac{p_{n-1}}{b} + \dots + \frac{p_0}{b^n} = G(b)
and similarly, G(a)G(c)G(a) \le G(c). Therefore,
P(a)n=aG(a)n<(b+c)G(a)nbG(b)n+cG(c)n=P(b)n+P(c)n,\sqrt[n]{P(a)} = a \sqrt[n]{G(a)} < (b + c) \sqrt[n]{G(a)} \le b \sqrt[n]{G(b)} + c \sqrt[n]{G(c)} = \sqrt[n]{P(b)} + \sqrt[n]{P(c)},
which is what was required to prove.

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.