Maths Olympiad Prep

Library / Saudi Arabian Mathematical Competitions /214 of 395

Saudi Arabian Mathematical Competitions

Algebra Difficulty 5.7 AIME, harder Prove it Saudi Arabia

Let P(x)P(x) be a polynomial of degree n≥2n \geq 2 with rational coefficients such that P(x)P(x) has nn pairwise different real roots forming an arithmetic progression. Prove that among the roots of P(x)P(x) there are two that are also the roots of some polynomial of degree 2 with rational coefficients.

Solution

Denote x1<x2<…<xnx_{1} < x_{2} < \ldots < x_{n} as the roots of P(x)P(x). Let d=xn−xn−1=⋯=x2−x1>0d = x_{n} - x_{n-1} = \cdots = x_{2} - x_{1} > 0. Since P(x)P(x) has rational coefficients then by applying Vieta's theorem, we have
∑i=1nxi∈Q and ∑1≤i<j≤nxixj∈Q. \sum_{i=1}^{n} x_{i} \in \mathbb{Q} \text{ and } \sum_{1 \leq i < j \leq n} x_{i} x_{j} \in \mathbb{Q} .
Note that ∑i=1nxi=n(x1+xn)2\sum_{i=1}^{n} x_{i} = \frac{n(x_{1} + x_{n})}{2} so x1+xn∈Qx_{1} + x_{n} \in \mathbb{Q}. On the other hand,
∑i=1nxi2=(∑i=1nxi)2−2∑1≤i<j≤nxixj∈Q \sum_{i=1}^{n} x_{i}^{2} = \left(\sum_{i=1}^{n} x_{i}\right)^{2} - 2 \sum_{1 \leq i < j \leq n} x_{i} x_{j} \in \mathbb{Q}
and
∑i=1nxi2=∑i=1n(x1+(i−1)d)2=nx12+n(n−1)x1d+n(n−1)(2n−1)6d2=n(x1+(n−1)d2)2+n2(n2−1)12d2=n(x1+xn)24+n(n2−1)12d2 \begin{aligned} \sum_{i=1}^{n} x_{i}^{2} & = \sum_{i=1}^{n} \left(x_{1} + (i-1)d\right)^{2} = n x_{1}^{2} + n(n-1) x_{1} d + \frac{n(n-1)(2n-1)}{6} d^{2} \\ & = n\left(x_{1} + \frac{(n-1)d}{2}\right)^{2} + \frac{n^{2}(n^{2}-1)}{12} d^{2} \\ & = \frac{n(x_{1} + x_{n})^{2}}{4} + \frac{n(n^{2}-1)}{12} d^{2} \end{aligned}
From these, we can conclude that n(n2−1)12d2∈Q\frac{n(n^{2}-1)}{12} d^{2} \in \mathbb{Q} so d2∈Qd^{2} \in \mathbb{Q}. Thus
x1xn=(x1+xn)2−(xn−x1)24=(x1+xn)2−(n−1)2d24∈Q. x_{1} x_{n} = \frac{(x_{1} + x_{n})^{2} - (x_{n} - x_{1})^{2}}{4} = \frac{(x_{1} + x_{n})^{2} - (n-1)^{2} d^{2}}{4} \in \mathbb{Q} .
Therefore, x1+xn,x1xn∈Qx_{1} + x_{n}, x_{1} x_{n} \in \mathbb{Q} which implies that two numbers x1,xnx_{1}, x_{n} satisfy.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.