Maths Olympiad Prep

Library / /91 of 121

Algebra Difficulty 6.6 National Olympiad Prove it India

Problem:
Suppose P(x)P(x) is a polynomial with real coefficients satisfying the condition P(cosθ+sinθ)=P(cosθsinθ)P(\cos \theta + \sin \theta) = P(\cos \theta - \sin \theta), for every real θ\theta. Prove that P(x)P(x) can be expressed in the form
P(x)=a0+a1(1x2)2+a2(1x2)4++an(1x2)2n P(x) = a_{0} + a_{1} (1 - x^{2})^{2} + a_{2} (1 - x^{2})^{4} + \cdots + a_{n} (1 - x^{2})^{2n}
for some real numbers a0,a1,a2,,ana_{0}, a_{1}, a_{2}, \ldots, a_{n} and nonnegative integer nn.

Solution

Solution:
Changing θ\theta to θπ/2\theta - \pi / 2, we see that
P(sinθ+cosθ)=P(sinθcosθ) P(\sin \theta + \cos \theta) = P(\sin \theta - \cos \theta)
This shows that P(x)=P(x)P(x) = P(-x) for all x[2,2]x \in [-\sqrt{2}, \sqrt{2}] and as PP is a polynomial, in fact,
P(x)=P(x) P(x) = P(-x)
for all xRx \in \mathbb{R}. Hence P(x)P(x) is an even polynomial; P(x)=Q(x2)P(x) = Q(x^{2}) for some polynomial Q(x)Q(x). This gives
Q(1+sin(2θ))=P(cosθ+sinθ)=P(cosθsinθ)=Q(1sin(2θ)) Q(1 + \sin(2\theta)) = P(\cos \theta + \sin \theta) = P(\cos \theta - \sin \theta) = Q(1 - \sin(2\theta))
Taking t=sin(2θ)t = \sin(2\theta), we see that Q(1+t)=Q(1t)Q(1 + t) = Q(1 - t). Hence Q(0)=Q(2)Q(0) = Q(2).

Consider Q(t)Q(0)Q(t) - Q(0). This vanishes both at t=0t = 0 and t=2t = 2. Hence t(2t)t(2 - t) is a factor of Q(t)Q(0)Q(t) - Q(0). We obtain
Q(t)Q(0)=t(2t)h(t) Q(t) - Q(0) = t(2 - t) h(t)
for some polynomial h(t)h(t). Using Q(1+t)=Q(1t)Q(1 + t) = Q(1 - t), it follows that h(1+t)=h(1t)h(1 + t) = h(1 - t). Hence by induction we get
Q(t)=k=0nbktk(2t)k Q(t) = \sum_{k=0}^{n} b_{k} t^{k} (2 - t)^{k}
Hence
P(x)=Q(x2)=k=0nbk(x2(2x2))k=k=0nbk(1(1x2)2)k P(x) = Q(x^{2}) = \sum_{k=0}^{n} b_{k} (x^{2}(2 - x^{2}))^{k} = \sum_{k=0}^{n} b_{k} (1 - (1 - x^{2})^{2})^{k}
Using binomial theorem, we can write this as
P(x)=k=0nak(1x2)2k P(x) = \sum_{k=0}^{n} a_{k} (1 - x^{2})^{2k}
for some coefficients aka_{k}, 0kn0 \leq k \leq 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 reproduced verbatim; metadata (topic, difficulty) added by this project.