Maths Olympiad Prep

Library / /402 of 462

Algebra Difficulty 7.0 National Olympiad Prove it Ireland

Suppose aa and bb are real numbers such that the quadratic polynomial
f(x)=x2+ax+b f(x) = x^2 + a x + b
has no nonnegative real roots. Prove that there exist two polynomials g,hg, h, whose coefficients are nonnegative real numbers, such that
f(x)=g(x)h(x), f(x) = \frac{g(x)}{h(x)},
for all real numbers xx.

Solution

First Solution. Since f(x)=0f(x) = 0 has no nonnegative real solutions, b=f(0)>0b = f(0) > 0. If a0a \ge 0, then take g(x)=f(x),h(x)=1g(x) = f(x), h(x) = 1. Suppose that a<0a < 0. Since f(x)=0f(x) = 0 has no nonnegative roots, we must have a2<4ba^2 < 4b. Replacing f(x)f(x) by b1f(xb)b^{-1} f(x \sqrt{b}), we may assume that b=1b = 1.

Put c1=ac_1 = -a and f1(x)=f(x)=x2c1x+1f_1(x) = f(x) = x^2 - c_1 x + 1. Note that c12<4c_1^2 < 4. Put f2(x)=f1(x)(x2+c1x+1)=x4c2x2+1f_2(x) = f_1(x)(x^2 + c_1 x + 1) = x^4 - c_2 x^2 + 1, where c2=c122c_2 = c_1^2 - 2. If c20c_2 \le 0, take g(x)=f2(x),h(x)=g(x)/f(x)g(x) = f_2(x), h(x) = g(x)/f(x) to satisfy the conclusion. If c2>0c_2 > 0, then put
f3(x)=f2(x)(x4+c2x2+1)=(x8c3x4+1), f_3(x) = f_2(x)(x^4 + c_2 x^2 + 1) = (x^8 - c_3 x^4 + 1),
so c3=c222c_3 = c_2^2 - 2. Proceeding in this way, suppose that fk(x)=(x2kckx2k1+1)f_k(x) = (x^{2k} - c_k x^{2k-1} + 1), where ck=ck122c_k = c_{k-1}^2 - 2, and that ck0c_k \le 0, then take g(x)=fk(x),h(x)=g(x)/f(x)g(x) = f_k(x), h(x) = g(x)/f(x) to satisfy the conclusion.

If ck>0c_k > 0, then put
fk+1(x)=fk(x)(x2k+ckx2k1+1)=x2k+1ck+1x2k+1. f_{k+1}(x) = f_k(x)(x^{2k} + c_k x^{2k-1} + 1) = x^{2k+1} - c_{k+1} x^{2k} + 1.

Suppose that ct>0c_t > 0 for all positive integers tt.
Then, for a positive integer nn, cn2>2c_n^2 > 2, cn12>2+2c_{n-1}^2 > 2+\sqrt{2}, cn22>2+2+2c_{n-2}^2 > 2+\sqrt{2+\sqrt{2}}, cn32>2+2+2+2c_{n-3}^2 > 2+\sqrt{2+\sqrt{2+\sqrt{2}}}, ..., and in general cns2>2+2+2+2++2c_{n-s}^2 > 2+\sqrt{2+\sqrt{2+\sqrt{2}+\dots+\sqrt{2}}} (s terms 2 under the radical signs). By the AGM inequality, 2+2>222=21+12+142+\sqrt{2} > 2\sqrt{2\sqrt{2}} = 2^{1+\frac{1}{2}+\frac{1}{4}}, and, in general,
2+2+2+2++2>21+12+14++12h+1, 2 + \sqrt{2 + \sqrt{2 + \sqrt{2 + \dots + \sqrt{2}}}} > 2^{1+\frac{1}{2}+\frac{1}{4}} + \dots + \frac{1}{2^{h+1}},
where there are hh terms 2 under the radical sign. Hence c12>21+12+14++12m+1c_1^2 > 2^{1+\frac{1}{2}+\frac{1}{4}} + \dots + \frac{1}{2^{m+1}}, for all positive integers mm.
Since the sum of the geometric progression
1+12+122++12n+ 1 + \frac{1}{2} + \frac{1}{2^2} + \dots + \frac{1}{2^n} + \dots
is 2, while c12<4c_1^2 < 4, this is a contradiction.
Hence ct0c_t \le 0 for some positive integer tt, and the proof is complete.

Solution 2:

This is based on the following observation, viz., if
p(x,θ)=x22cosθx+1, p(x, \theta) = x^2 - 2 \cos \theta x + 1,
then
p(x,θ)p(x,θ+π)=(x22cosθx+1)(x2+2cosθx+1)=x42(2cos2θ1)x2+1=x42cos2θx2+1=p(x2,2θ). \begin{aligned} p(x, \theta)p(x, \theta + \pi) &= (x^2 - 2 \cos \theta x + 1)(x^2 + 2 \cos \theta x + 1) \\ &= x^4 - 2(2 \cos^2 \theta - 1)x^2 + 1 \\ &= x^4 - 2 \cos 2\theta x^2 + 1 \\ &= p(x^2, 2\theta). \end{aligned}

To continue, as in the First Solution, it suffices to consider the case f(x)=x2cx+1f(x) = x^2 - c x + 1, where 0<c<20 < c < 2. Select θ(0,π/2)\theta \in (0, \pi/2), so that c=2cosθc = 2 \cos \theta. Then f(x)=p(x,θ)f(x) = p(x, \theta) and so
f(x)p(x,θ+π)=p(x2,2θ)=x42cos2θx2+1. f(x)p(x, \theta + \pi) = p(x^2, 2\theta) = x^4 - 2 \cos 2\theta x^2 + 1.

If cos2θ0\cos 2\theta \le 0, we stop and take g(x)=p(x2,2θ)g(x) = p(x^2, 2\theta) and h(x)=p(x,θ+π)h(x) = p(x, \theta + \pi). Otherwise, we repeat the process and use the fact that
p(x2,2θ)p(x2,2θ+π)=p(x4,4θ). p(x^2, 2\theta)p(x^2, 2\theta + \pi) = p(x^4, 4\theta).

We stop if cos4θ0\cos 4\theta \le 0, and put
g(x)=p(x4,4θ),h(x)=p(x,θ+π)p(x2,2θ+π). g(x) = p(x^4, 4\theta), \quad h(x) = p(x, \theta + \pi)p(x^2, 2\theta + \pi).
Otherwise we continue. We stop at the nnth stage where cos2nθ0\cos 2^n\theta \le 0, and cos2n1θ>0\cos 2^{n-1}\theta > 0, at which point we let
g(x)=p(x2n,2nθ),h(x)=p(x,θ+π)k=12n1p(x2k,2kθ+π). g(x) = p(x^{2^n}, 2^n\theta), \quad h(x) = p(x, \theta + \pi) \prod_{k=1}^{2^n-1} p(x^{2^k}, 2^k\theta + \pi).

It's clear that g,hg, h are polynomials whose coefficients are nonnegative, and that f=g/hf = g/h.

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.