Maths Olympiad Prep

Library / /331 of 397

, 2021

Algebra Difficulty 6.8 National Olympiad Prove it Taiwan

A magician intends to perform the following trick. She announces a positive integer nn, along with 2n2n real numbers x1<<x2nx_1 < \dots < x_{2n}, to the audience. A member of the audience then secretly chooses a polynomial P(x)P(x) of degree nn with real coefficients, computes the 2n2n values P(x1),,P(x2n)P(x_1), \dots, P(x_{2n}), and writes down these 2n2n values on the blackboard in non-decreasing order. After that the magician announces the secret polynomial to the audience.
Determine all nn such that the magician can find a strategy to perform such a trick.

Solution

There doesn't exist such a nn.
Let x1<x2<<x2nx_1 < x_2 < \cdots < x_{2n} be real numbers chosen by the magician. We will construct two distinct polynomials P(x)P(x) and Q(x)Q(x), each of degree nn, such that the member of audience will write down the same sequence for both polynomials. This will mean that the magician cannot distinguish PP from QQ.

Claim. There exists a polynomial P(x)P(x) of degree nn such that P(x2i1)+P(x2i)=0P(x_{2i-1}) + P(x_{2i}) = 0 for i=1,2,,ni = 1, 2, \dots, n.

Proof. We want to find a polynomial anxn++a1x+a0a_n x^n + \cdots + a_1 x + a_0 satisfying the following system of equations:
{(x1n+x2n)an+(x1n1+x2n1)an1++2a0=0(x3n+x4n)an+(x3n1+x4n1)an1++2a0=0(x2n1n+x2nn)an+(x2n1n1+x2nn1)an1++2a0=0 \left\{ \begin{array}{l} (x_1^n + x_2^n)a_n + (x_1^{n-1} + x_2^{n-1})a_{n-1} + \cdots + 2a_0 = 0 \\ (x_3^n + x_4^n)a_n + (x_3^{n-1} + x_4^{n-1})a_{n-1} + \cdots + 2a_0 = 0 \\ \cdots \\ (x_{2n-1}^n + x_{2n}^n)a_n + (x_{2n-1}^{n-1} + x_{2n}^{n-1})a_{n-1} + \cdots + 2a_0 = 0 \end{array} \right.
We use the well known fact that a homogeneous system of nn linear equations in n+1n+1 variables has a nonzero solution. (This fact can be proved using induction on nn, via elimination of variables.) Applying this fact to the above system, we find a nonzero polynomial P(x)P(x) of degree not exceeding nn such that its coefficients a0,,ana_0, \dots, a_n satisfy this system. Therefore P(x2i1)+P(x2i)=0P(x_{2i-1}) + P(x_{2i}) = 0 for all i=1,2,,ni = 1, 2, \dots, n. Notice that PP has a root on each segment [x2i1,x2i][x_{2i-1}, x_{2i}] by the Intermediate Value theorem, so nn roots in total. Since PP is nonzero, we get degP=n\deg P = n.

Now consider a polynomial P(x)P(x) provided by the Claim, and take Q(x)=P(x)Q(x) = -P(x). The properties of P(x)P(x) yield that P(x2i1)=Q(x2i)P(x_{2i-1}) = Q(x_{2i}) and Q(x2i1)=P(x2i)Q(x_{2i-1}) = P(x_{2i}) for all i=1,2,,ni = 1, 2, \dots, n. It is also clear that PP=QP \neq -P = Q and degQ=degP=n\deg Q = \deg P = n.

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 translated into English from zh; metadata (topic, difficulty) added by this project.