Prove that there is no non-constant polynomial f(x), with integer coefficients, such that f(x) is prime for all integers x.

I just started modular arithmetic, so if someone can explain to me how to apply modular arithmetic to prove this, it would be much appreciated!