Maths Olympiad Prep

Library / /29 of 61

Algebra Difficulty 6.4 National Olympiad Prove it Canada

Problem:
Let nn be an integer greater than 11, and let a0,a1,,ana_{0}, a_{1}, \ldots, a_{n} be real numbers with a1=an1=0a_{1} = a_{n-1} = 0. Prove that for any real number kk,

a0ani=0n2aikai+1ai+2 \left|a_{0}\right| - \left|a_{n}\right| \leq \sum_{i=0}^{n-2} \left|a_{i} - k a_{i+1} - a_{i+2}\right|

Solution

Solution:
Let Q(x)=x2kx1Q(x) = x^{2} - k x - 1 and let P(x)=a0+a1x++anxnP(x) = a_{0} + a_{1} x + \cdots + a_{n} x^{n}. Note that the product of the two roots of Q(x)Q(x) is 1-1 and thus one of the two roots has magnitude at most 11. Let zz be this root. Now note that since a1=an1=0a_{1} = a_{n-1} = 0, we have that
0=Q(z)P(z)=a0ka0z+i=0n2(aikai+1ai+2)zi+2kanzn+1+anzn+2=a0(1kz)+i=0n2(aikai+1ai+2)zi+2+anzn(z2kz)=a0z2+i=0n2(aikai+1ai+2)zi+2+anzn \begin{aligned} 0 = Q(z) P(z) & = -a_{0} - k a_{0} z + \sum_{i=0}^{n-2} \left(a_{i} - k a_{i+1} - a_{i+2}\right) z^{i+2} - k a_{n} z^{n+1} + a_{n} z^{n+2} \\ & = a_{0}(-1 - k z) + \sum_{i=0}^{n-2} \left(a_{i} - k a_{i+1} - a_{i+2}\right) z^{i+2} + a_{n} z^{n} (z^{2} - k z) \\ & = -a_{0} z^{2} + \sum_{i=0}^{n-2} \left(a_{i} - k a_{i+1} - a_{i+2}\right) z^{i+2} + a_{n} z^{n} \end{aligned}
where the third equality follows since z2kz1=0z^{2} - k z - 1 = 0. The triangle inequality now implies
a0z2anzn+i=0n2aikai+1ai+2zi+2anz2+i=0n2aikai+1ai+2z2 \begin{aligned} \left|a_{0}\right| \cdot |z|^{2} & \leq \left|a_{n}\right| \cdot |z|^{n} + \sum_{i=0}^{n-2} \left|a_{i} - k a_{i+1} - a_{i+2}\right| \cdot |z|^{i+2} \\ & \leq \left|a_{n}\right| \cdot |z|^{2} + \sum_{i=0}^{n-2} \left|a_{i} - k a_{i+1} - a_{i+2}\right| \cdot |z|^{2} \end{aligned}
since z1|z| \leq 1 and n2n \geq 2. Since z0z \neq 0, the inequality is obtained on dividing by z2|z|^{2}.

Solution 2:
Let kk be a real number. Put
R={k2+4 if k0k2+4 if k<0 R = \begin{cases} \sqrt{k^{2} + 4} & \text{ if } k \geq 0 \\ -\sqrt{k^{2} + 4} & \text{ if } k < 0 \end{cases}
Define the polynomial
S(x)=x2+Rx+1 S(x) = x^{2} + R x + 1
The roots of SS are
b=Rk2 and c=R+k2 b = \frac{-R - k}{2} \quad \text{ and } \quad c = \frac{-R + k}{2}
Then we have
bc=k,bc=1, and c1 b - c = -k, \quad b c = 1, \quad \text{ and } \quad |c| \leq 1
(the inequality follows from bc=1b c = 1 and cb|c| \leq |b|).
Put di=ai+bai+1d_{i} = a_{i} + b a_{i+1} for i=0,1,,n1i = 0, 1, \ldots, n-1. Then, for i=0,1,,n2i = 0, 1, \ldots, n-2, we have
dicdi+1=ai+(bc)ai+1bcai+2=aikai+1ai+2 \begin{aligned} d_{i} - c d_{i+1} & = a_{i} + (b - c) a_{i+1} - b c a_{i+2} \\ & = a_{i} - k a_{i+1} - a_{i+2} \end{aligned}
Therefore
i=0n2aikai+1ai+2=i=0n2dicdi+1i=0n2(dicdi+1)=d0+(1c)i=1n2dicdn1d0cdn1=a0+ba1can1+ban=a0bcan=a0an \begin{aligned} \sum_{i=0}^{n-2} \left|a_{i} - k a_{i+1} - a_{i+2}\right| & = \sum_{i=0}^{n-2} \left|d_{i} - c d_{i+1}\right| \\ & \geq \sum_{i=0}^{n-2} \left( \left|d_{i}\right| - |c| \left|d_{i+1}\right| \right) \\ & = \left|d_{0}\right| + (1 - |c|) \sum_{i=1}^{n-2} \left|d_{i}\right| - |c| \left|d_{n-1}\right| \\ & \geq \left|d_{0}\right| - |c| \left|d_{n-1}\right| \\ & = \left|a_{0} + b a_{1}\right| - |c| \left|a_{n-1} + b a_{n}\right| \\ & = \left|a_{0}\right| - |b c| \left|a_{n}\right| \\ & = \left|a_{0}\right| - \left|a_{n}\right| \end{aligned}

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.