AlgebraDifficulty 7.4National Olympiad, round 2Prove itUnited States
Let a, b, c, d be real numbers such that b−d≥5 and all zeros x1, x2, x3, and x4 of the polynomial P(x)=x4+ax3+bx2+cx+d are real. Find the smallest value the product (x12+1)(x22+1)(x32+1)(x42+1) can take.
Solutions — 2
Solution 1
Solution 1 (by Titu Andreescu). Using Vieta's identities we have: x1x2+x1x3+x1x4+x2x3+x2x4+x3x4−x1x2x3x4≥5, and so x1(x2+x3+x4−x2x3x4)+1(x2x3+x2x4+x3x4−1)≥4. It follows that 42≤[x1(x2+x3+x4−x2x3x4)+1(x2x3+x2x4+x3x4−1)]2, so by the Cauchy-Schwarz Inequality, 42≤(x12+1)[(x2+x3+x4−x2x3x4)2+(x2x3+x2x4+x3x4−1)2]=(x12+1)(x22+1)(x32+1)(x42+1). Setting x1=⋯=x4=1 gives b−d=5 and makes the product attain its minimum possible value of 16.
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)=((1−b+d)+i(c−a))(1−b+d−i(c−a))=(b−d−1)2+(c−a)2≥16, with equality if and only if b−d=5 and a=c, both attained if x1=⋯=x4=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.