Polynomial with integer coefficients satisfies the following condition: for every polynomials , , with integer coefficients, if
then either or is a constant polynomial. Prove that has to be a constant polynomial.
, 2011
Solution
For the sake of contradiction suppose that is not constant and consider the case when is a linear polynomial. It means that for some , where . Let . Then
but polynomials and are not constant, a contradiction.
Now suppose that . Suppose also that
where . Consider a polynomial . Clearly it has integer coefficients. Moreover,
From the formula
it follows that the polynomial is divisible by the polynomial . So is divisible by as well. But this is a contradiction, since implies that the degree of is greater than the degree of , which means that is a non-trivial divisor of . Conclusion follows.
Looking for a route rather than an archive? The track puts 2,000
problems in a working order, from AMC 10 level to the IMO shortlist.