Maths Olympiad Prep

Library / /119 of 377

Algebra Difficulty 4.9 AIME Prove it United States

Problem:

Let P(x)=anxn+an1xn1++a0P(x) = a_{n} x^{n} + a_{n-1} x^{n-1} + \cdots + a_{0} be a polynomial with real coefficients, an0a_{n} \neq 0. Suppose every root of PP is a root of unity, but P(1)0P(1) \neq 0. Show that the coefficients of PP are symmetric; that is, show that an=a0,an1=a1,a_{n} = a_{0}, a_{n-1} = a_{1}, \ldots

Solution

Solution:

Since the coefficients of PP are real, the complex conjugates of the roots of PP are also roots of PP. Now, if xx is a root of unity, then x1=xˉx^{-1} = \bar{x}. But the roots of
xnP(x1)=a0xn+a1xn1++an x^{n} P\left(x^{-1}\right) = a_{0} x^{n} + a_{1} x^{n-1} + \cdots + a_{n}
are then just the complex conjugates of the roots of PP, so they are the roots of PP. Therefore, P(x)P(x) and xnP(x1)x^{n} P\left(x^{-1}\right) differ by a constant multiple cc. Since an=ca0a_{n} = c a_{0} and a0=cana_{0} = c a_{n}, cc is either 11 or 1-1. But if it were 1-1, then
P(1)=an+an1++a0=12((an+a0)+(an1+a1)++(a0+an))=0, P(1) = a_{n} + a_{n-1} + \cdots + a_{0} = \frac{1}{2}\left(\left(a_{n} + a_{0}\right) + \left(a_{n-1} + a_{1}\right) + \cdots + \left(a_{0} + a_{n}\right)\right) = 0,
a contradiction. Therefore c=1c = 1, giving the result.

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.