Let f(x) be a nonconstant polynomial in x with integer coefficients and suppose that for five distinct integers a1, a2, a3, a4, a5, one has f(a1)= f(a2)= f(a3)= f(a4)= f(a5)= 2.
Find all integers b such that f(b)= 9.
(In reply to
re: Solution (spoiler) by Richard)
Actually, that h(x) has integer coefficients, in this case, is simple, and I didn't need Gauss' Lema.
First, (xa1)(xa2)(xa3)(xa4)(xa5) is a polynomial with integer coeefficients, since a1 through a5 are integers. Let's write this product as r(x)= x^5+r4.x^4+...+r1.x+r0.
Suppose we have f(x)=fn.x^n+...+f2.x^2+f1.x+f0 with f0 through fn all integers.
Finally write h(x)=hm.x^m+...+h2.x^2+h1.x+h0. (In this case, m=n5, but that doesn't matter.)
When we multiply r(x) and h(x) to get f(x), the highest order term (which must be fn) is hm... so hm is an integer. The next highest order term (f(n1)) is r4.hm+h(m1), so h(m1) is also an integer. Keep working this way, and all h's turn out to be integers.
Edited on May 27, 2006, 8:11 am

Posted by e.g.
on 20060527 08:09:37 