Maths Olympiad Prep

Library / /2 of 16

, 2023

Algebra Difficulty 7.8 National olympiad, round 2 Prove it Turkey

Let nn be a positive integer and P,QP, Q be polynomials with real coefficients such that P(x)=xnQ(1/x)P(x) = x^n Q(1/x) and P(x)Q(x)P(x) \ge Q(x) for all real numbers xx. Prove that P(x)=Q(x)P(x) = Q(x) for all real numbers xx.

Solution

We are given that P(x)=xnQ(1/x)P(x) = x^n Q(1/x) and P(x)Q(x)P(x) \ge Q(x) for all real xx.

First, note that P(x)=xnQ(1/x)P(x) = x^n Q(1/x) for all x0x \ne 0 (since QQ is a polynomial, Q(1/x)Q(1/x) is defined for x0x \ne 0).

Also, P(x)Q(x)P(x) \ge Q(x) for all real xx.

Let us substitute xx by 1/x1/x (for x0x \ne 0):

P(1/x)=(1/x)nQ(x)=xnQ(x)P(1/x) = (1/x)^n Q(x) = x^{-n} Q(x).

But P(1/x)Q(1/x)P(1/x) \ge Q(1/x) for all x0x \ne 0.

Now, multiply both sides by xnx^n (for x>0x > 0):

xnP(1/x)xnQ(1/x)x^n P(1/x) \ge x^n Q(1/x).

But xnP(1/x)=Q(x)x^n P(1/x) = Q(x), and xnQ(1/x)=P(x)x^n Q(1/x) = P(x), so:

Q(x)P(x)Q(x) \ge P(x) for all x>0x > 0.

But from the original condition, P(x)Q(x)P(x) \ge Q(x) for all xx.

Therefore, for all x>0x > 0, P(x)=Q(x)P(x) = Q(x).

Since PP and QQ are polynomials, and two polynomials that agree on an infinite set (here, all x>0x > 0) must be equal everywhere, we conclude that P(x)=Q(x)P(x) = Q(x) for all real xx.

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 and solution reproduced as published; topic and difficulty added by this site.