Theorem 1 Every nontrivial integer polynomial has a composite value

Proof. Let
n
X
f (x) = a x :
=0

Since
# fx 2 Z : f (x) 2 f 1; 0; 1gg 3n;
there is an M so that m M implies jf (m)j 2; so if f is never composite,
there is a prime p such that f (M ) = p. Since

# fx 2 Z : f (x) 2 f p; 1; 0; 1; pgg 5n;

there is an N so that m N implies f (m) 2= f p; 1; 0; 1; pg. Pick j large

enough so that M + jp N . Then for some prime q 6= p, f (M + jp) = q.
Working mod p,
n
X
q = f (M + jp) = a (M + jp)
=0
n
X
a M = p;
=0

which is a contradiction.