MathLabs

Problem 5

Find all polynomials P(x)P(x) with integer coefficients such that for all real numbers ss and tt, if P(s)P(s) and P(t)P(t) are both integers, then P(st)P(st) is also an integer.
Step 4 of 8: A proper factor would have a small root
P(x)−p=f1(x)g1(x),f1(0)g1(0)=−p,f1(0)=±1 ⟹ ∃ r: f1(r)=0, ∣r∣≤1P(x)-p=f_1(x)g_1(x),\quad f_1(0)g_1(0)=-p,\quad f_1(0)=\pm1\ \Longrightarrow\ \exists\, r:\ f_1(r)=0,\ |r|\le1
Detailed analysis

Suppose ff is a proper factor of P(x)−pP(x)-p, so P(x)−p=f(x)g(x)P(x)-p=f(x)g(x) with f,gf,g non-constant. By Gauss's lemma there are integer-coefficient f1,g1f_1,g_1, scalar multiples of f,gf,g, with P(x)−p=f1(x)g1(x)P(x)-p=f_1(x)g_1(x); since f1(0)g1(0)=P(0)−p=−pf_1(0)g_1(0)=P(0)-p=-p and pp is prime, we may take f1(0)=±1f_1(0)=\pm1. If every root of f1f_1 had absolute value greater than 11, then ∣f1(0)∣|f_1(0)| would equal the leading coefficient of f1f_1 (an integer of absolute value ≥1\ge1) times the product of root magnitudes, which exceeds 11; this contradicts ∣f1(0)∣=1|f_1(0)|=1. So f1f_1, and hence P(x)−pP(x)-p, has a root rr with ∣r∣≤1|r|\le1.