Maths Olympiad Prep

Library / /39 of 53

Algebra Difficulty 7.0 National olympiad Prove it Vietnam

Consider the following polynomial
f(x)=x2αx+1 f(x) = x^2 - \alpha x + 1
with αR\alpha \in \mathbb{R}.

a) For α=152\alpha = \frac{\sqrt{15}}{2}, express f(x)f(x) as the quotient of two polynomials with non-negative coefficients.

b) Find all values of α\alpha such that f(x)f(x) can be written as the quotient of two polynomials with non-negative coefficients.

Solution

a. We consider the following transformation
(x2152x+1)(x2+152x+1)=x474x2+1, \left(x^2 - \frac{\sqrt{15}}{2}x + 1\right) \left(x^2 + \frac{\sqrt{15}}{2}x + 1\right) = x^4 - \frac{7}{4}x^2 + 1,
(x474x2+1)(x4+74x2+1)=x81716x4+1, \left(x^{4} - \frac{7}{4}x^{2} + 1\right) \left(x^{4} + \frac{7}{4}x^{2} + 1\right) = x^{8} - \frac{17}{16}x^{4} + 1,
(x81716x4+1)(x8+1716x4+1)=x16+223256x8+1. \left(x^{8} - \frac{17}{16}x^{4} + 1\right) \left(x^{8} + \frac{17}{16}x^{4} + 1\right) = x^{16} + \frac{223}{256}x^{8} + 1.
It follows that f(x)f(x) is the quotient of x16+223256x8+1x^{16} + \frac{223}{256}x^8 + 1 and
(x2+152x+1)(x4+74x2+1)(x8+1716x4+1). \left(x^2 + \frac{\sqrt{15}}{2}x + 1\right) \left(x^4 + \frac{7}{4}x^2 + 1\right) \left(x^8 + \frac{17}{16}x^4 + 1\right).

b. Suppose P(x)Q(x)=x2αx+1\frac{P(x)}{Q(x)} = x^2 - \alpha x + 1 where P,QP, Q are polynomials with non-negative coefficients. Substituting x=1x = 1, we have
2α=P(1)Q(1)>0 so α<2. 2 - \alpha = \frac{P(1)}{Q(1)} > 0 \text{ so } \alpha < 2.
We will prove that every real number α<2\alpha < 2 satisfies the problem. Indeed, if α0\alpha \le 0 then the polynomial f(x)f(x) itself is satisfied, so we can choose P(x)=f(x)P(x) = f(x), Q(x)=1Q(x) = 1.
If α(0;2)\alpha \in (0; 2), let us consider the multiplication
(x2αx+1)(x2+αx+1)=x4+(2α2)x2+1. (x^2 - \alpha x + 1)(x^2 + \alpha x + 1) = x^4 + (2 - \alpha^2)x^2 + 1.
Continuing like that, we find that the coefficients of the first and last terms of the polynomial are always 1, and the middle coefficient is determined by the sequence (un)(u_n) as follows
{u0=α,un+1=2un2,n0. \begin{cases} u_0 = \alpha, \\ u_{n+1} = 2 - u_n^2, \quad n \ge 0. \end{cases}
We will prove that there exists a positive term in this sequence. Suppose that for every n1n \ge 1, un<0u_n < 0. Then, since α(0;2)\alpha \in (0; 2) so by induction, we can show that 2<un<0,n1-2 < u_n < 0, \forall n \ge 1. Note that
un+1un=2unun2=(2+un)(1un)>0, u_{n+1} - u_n = 2 - u_n - u_n^2 = (2 + u_n)(1 - u_n) > 0,
so un+1un>0,n1u_{n+1} - u_n > 0, \forall n \ge 1; shows that this sequence increases. Since the sequence is bounded by 0 so it has a limit L(2;0]L \in (-2; 0]. By letting nn tend to infinity, we have
L=2L2 so L{1;2}. L = 2 - L^2 \text{ so } L \in \{1; -2\}.
This contradiction shows that there exists n=Nn = N so that uN0u_N \ge 0. Consider the polynomials sequence
fn(x)=x2n+1+unx2n+1 f_n(x) = x^{2n+1} + u_n x^{2n} + 1
with n=1,2,3,,Nn = 1, 2, 3, \dots, N it is easy to see that f(x)f(x) is the quotient of two polynomials fN(x)f_N(x) and f1(x)f2(x)fN1(x)f_1(x)f_2(x) \dots f_{N-1}(x). Clearly, these polynomials have non-negative coefficients. \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.