Maths Olympiad Prep

Library / /4 of 4

, 2020

Algebra Difficulty 8.5 Shortlist Prove it Netherlands

Let a1,a2,,a2020a_1, a_2, \dots, a_{2020} be real numbers, not necessarily distinct. For all n2020n \ge 2020, let an+1a_{n+1} be the minimal real root of the polynomial
Pn(x)=x2n+a1x2n2+a2x2n4++an1x2+an, P_n(x) = x^{2n} + a_1 x^{2n-2} + a_2 x^{2n-4} + \dots + a_{n-1} x^2 + a_n,
if it exists. Assume that an+1a_{n+1} exists for all n2020n \ge 2020. Prove that an+1ana_{n+1} \le a_n for all n2021n \ge 2021.

Solution

If x=αx = \alpha is a root of PnP_n, then x=αx = -\alpha is a root of PnP_n as well, as all terms of PnP_n have even degree. The minimal root of PnP_n therefore cannot be positive. Therefore an0a_n \le 0 for all n>2020n > 2020.

We have Pn+1(x)=x2Pn(x)+an+1P_{n+1}(x) = x^2 \cdot P_n(x) + a_{n+1}. Substitute x=an+1x = a_{n+1}; as that is a root of PnP_n, we have Pn+1(an+1)=0+an+10P_{n+1}(a_{n+1}) = 0 + a_{n+1} \le 0.

As the maximal degree term in Pn(x)P_n(x) is x2nx^{2n}, there exists an N<0N < 0 such that Pn(x)>0P_n(x) > 0 for all x<Nx < N. Taking for example N=max(2,a1+a2++an)-N = \max(2, |a_1| + |a_2| + \dots + |a_n|), we see for x<Nx < N that x2i2x2n2x^{2i-2} \le x^{2n-2} for all 1in1 \le i \le n and therefore that
a1x2n2+a2x2n4++an1x2+ana1x2n2+a2x2n4++an1x2+ana1x2n2+a2x2n2++an1x2n2+anx2n2(a1+a2++an)x2n2Nx2n2<x2n, \begin{aligned} & |a_1x^{2n-2} + a_2x^{2n-4} + \dots + a_{n-1}x^2 + a_n| \\ & \le |a_1x^{2n-2}| + |a_2x^{2n-4}| + \dots + |a_{n-1}x^2| + |a_n| \\ & \le |a_1x^{2n-2}| + |a_2x^{2n-2}| + \dots + |a_{n-1}x^{2n-2}| + |a_n|x^{2n-2} \\ & \le (|a_1| + |a_2| + \dots + |a_n|)x^{2n-2} \\ & \le -N \cdot x^{2n-2} \\ & < x^{2n}, \end{aligned}
so x2n+a1x2n2+a2x2n4++an1x2+an>0x^{2n} + a_1x^{2n-2} + a_2x^{2n-4} + \dots + a_{n-1}x^2 + a_n > 0. Hence for n2021n \ge 2021 there exists an N<0N < 0 with Pn(x)>0P_n(x) > 0 for all x<Nx < N, whereas Pn(an)0P_n(a_n) \le 0. Therefore Pn(x)P_n(x) has a root smaller than ana_n. As an+1a_{n+1} is the minimal root, we have an+1ana_{n+1} \le a_n. \square

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.