Let f ϵ Z [ X, Y ] be irreducible. We give a condition that there are only finitely many integers n ϵ Z such that f is reducible and we give a bound for such integers. We prove a similar result for polynomials with coefficients in polynomial rings. Both results are proved by, so-called, nonstandard arithmetic.