Maths Olympiad Prep

Library / /82 of 169

Algebra Difficulty 7.4 National Olympiad, round 2 Prove it United States

Let aa, bb, cc, dd be real numbers such that bd5b - d \ge 5 and all zeros x1x_1, x2x_2, x3x_3, and x4x_4 of the polynomial P(x)=x4+ax3+bx2+cx+dP(x) = x^4 + a x^3 + b x^2 + c x + d are real. Find the smallest value the product (x12+1)(x22+1)(x32+1)(x42+1)(x_1^2 + 1)(x_2^2 + 1)(x_3^2 + 1)(x_4^2 + 1) can take.

Solutions — 2

Solution 1

Solution 1 (by Titu Andreescu). Using Vieta's identities we have:
x1x2+x1x3+x1x4+x2x3+x2x4+x3x4x1x2x3x45, x_1x_2 + x_1x_3 + x_1x_4 + x_2x_3 + x_2x_4 + x_3x_4 - x_1x_2x_3x_4 \ge 5,
and so
x1(x2+x3+x4x2x3x4)+1(x2x3+x2x4+x3x41)4. x_1(x_2 + x_3 + x_4 - x_2x_3x_4) + 1(x_2x_3 + x_2x_4 + x_3x_4 - 1) \ge 4.
It follows that
42[x1(x2+x3+x4x2x3x4)+1(x2x3+x2x4+x3x41)]2, 4^2 \le [x_1(x_2 + x_3 + x_4 - x_2x_3x_4) + 1(x_2x_3 + x_2x_4 + x_3x_4 - 1)]^2,
so by the Cauchy-Schwarz Inequality,
42(x12+1)[(x2+x3+x4x2x3x4)2+(x2x3+x2x4+x3x41)2]=(x12+1)(x22+1)(x32+1)(x42+1). \begin{aligned} 4^2 &\le (x_1^2 + 1)[(x_2 + x_3 + x_4 - x_2x_3x_4)^2 + (x_2x_3 + x_2x_4 + x_3x_4 - 1)^2] \\ &= (x_1^2 + 1)(x_2^2 + 1)(x_3^2 + 1)(x_4^2 + 1). \end{aligned}
Setting x1==x4=1x_1 = \dots = x_4 = 1 gives bd=5b - d = 5 and makes the product attain its minimum possible value of 1616.

Solution 2

Solution 2 (by Titu Andreescu). An alternative, shorter argument runs as follows: we have
(x12+1)(x22+1)(x32+1)(x42+1)=P(i)P(i)=((1b+d)+i(ca))(1b+di(ca))=(bd1)2+(ca)216, (x_1^2 + 1)(x_2^2 + 1)(x_3^2 + 1)(x_4^2 + 1) = P(i)P(-i) = ((1 - b + d) + i(c - a))(1 - b + d - i(c - a)) = (b - d - 1)^2 + (c - a)^2 \ge 16,
with equality if and only if bd=5b - d = 5 and a=ca = c, both attained if x1==x4=1x_1 = \dots = x_4 = 1.

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 reproduced verbatim; metadata (topic, difficulty) added by this project.