Maths Olympiad Prep

Library / SAUDI ARABIAN IMO Booklet /21 of 25

SAUDI ARABIAN IMO Booklet, 2023

Algebra Difficulty 8.6 Shortlist Prove it Saudi Arabia

Find all positive integer n>1n > 1 such that: there exist some real coefficient polynomial P(x)P(x) of degree nn, having the leading coefficient as 11 and there exist distinct real numbers r,s,tr, s, t with the sum is −2023-2023 and P(k)∈{r,s,t}P(k) \in \{r, s, t\} for all k=1,2,3,…,3n−1,3nk = 1, 2, 3, \dots, 3n - 1, 3n.

Solution

For n=2n = 2, we have P(k)∈{r,s,t}P(k) \in \{r, s, t\} with k=1,2,3,4,5,6k = 1, 2, 3, 4, 5, 6. Since deg⁡P=2\deg P = 2, there are no more than 22 value of kk such that P(k)=rP(k) = r. Similarly for P(k)=sP(k) = s, P(k)=tP(k) = t. From this it follows that each of the above equations must have exactly 22 solutions. Notice that all three equations have the same coefficients x2x^2 and xx so the sum of the solutions of them are equal and should be 77. Then the 66 solutions above will be divided in pairs (1,6)(1, 6), (2,5)(2, 5), (3,4)(3, 4). We can assume
{P(x)−r=(x−1)(x−6)P(x)−s=(x−2)(x−5)P(x)−t=(x−3)(x−4) \begin{cases} P(x) - r = (x - 1)(x - 6) \\ P(x) - s = (x - 2)(x - 5) \\ P(x) - t = (x - 3)(x - 4) \end{cases}
from this, it follows that
3P(x)−(r+s+t)=(x−1)(x−6)+(x−2)(x−5)+(x−3)(x−4) 3P(x) - (r + s + t) = (x - 1)(x - 6) + (x - 2)(x - 5) + (x - 3)(x - 4)
or 3P(x)+2023=3x2−21x+283P(x) + 2023 = 3x^2 - 21x + 28 so P(x)=x2−7x−665P(x) = x^2 - 7x - 665 and r,s,tr, s, t respectively are −671,−675,−677-671, -675, -677.

Next, suppose there exists P(x)P(x) of degree n≥3n \ge 3 satisfying the given problem, without loss of generality suppose r<s<tr < s < t. According to the argument above, each equation P(x)−rP(x) - r, P(x)−sP(x) - s, P(x)−tP(x) - t there will be exactly nn distinct solutions from {1,2,3,…,3n}\{1, 2, 3, \dots, 3n\}. In addition, according to Viete's theorem, since each equation has at least the first three coefficients in common. First the sum of the solutions and the sum of the squares of their solutions must be equal.

Considering the function f(x)=P(x)−rf(x) = P(x) - r has nn distinct solutions, according to the mean-value theorem, f′(x)=P′(x)f'(x) = P'(x) must have n−1n-1 distinct roots, denoted by c1<c2<⋯<cn−1c_1 < c_2 < \dots < c_{n-1}. The equation P(x)=rP(x) = r have unique root on each interval (−∞;c1),(c1,c2),…,(cn−1,+∞)(-\infty; c_1), (c_1, c_2), \dots, (c_{n-1}, +\infty). The same for P(x)=sP(x) = s, P(x)=tP(x) = t. We have the following two cases:
Figure 1

Case 1. If nn is odd then it is easy to see in the first interval, P(x)P(x) increasing so P(x)=rP(x) = r, P(x)=sP(x) = s, P(x)=tP(x) = t will take the roots 1,2,31, 2, 3. in that other. In the next interval, the function is decreasing so they will take the roots of 6,5,46, 5, 4 respectively, and so on, to the end of the interval will end up with 3n−2,3n−1,3n3n - 2, 3n - 1, 3n. Then, it is easy to see that the sum of the solutions of the three equations in the first interval n−1n-1 are equal, but in the last interval, each equation has a different solution, so the sum of their solutions is different, contradiction.

Case 2. If nn is even, put n=2mn = 2m then the three equations will have solutions of 1,2,3,…,6m1, 2, 3, \dots, 6m and similar to the above argument, P(x)=rP(x) = r there will be solutions {1,6,7,12,…,6m−5,6m}\{1, 6, 7, 12, \dots, 6m - 5, 6m\}. The sum of the squares of these numbers will be
∑k=1m(6k−5)2+(6k)2=∑k=1m(72k2−60k+25)=m(24m2+6m+7). \sum_{k=1}^{m} (6k-5)^2 + (6k)^2 = \sum_{k=1}^{m} (72k^2 - 60k + 25) = m(24m^2 + 6m + 7).
Otherwise, the sum of squares of all 6m6m numbers is
6m(6m+1)(12m+1)6=m(6m+1)(12m+1) \frac{6m(6m+1)(12m+1)}{6} = m(6m+1)(12m+1)
so each equation must whose sum of squares of the solutions is 13\frac{1}{3} of this value. Thus
3m(24m2+6m+7)=m(6m+1)(12m+1) 3m(24m^2 + 6m + 7) = m(6m + 1)(12m + 1)
or
72m2+18m+21=72m2+18m+1, 72m^2 + 18m + 21 = 72m^2 + 18m + 1,
contradiction. This shows that in all cases we cannot have a polynomial P(x)P(x) satisfying the problem.

So the only positive integer that satisfies the problem is n=2n = 2. □

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.