Let f(x) be a polynomial with integer coefficients. Prove that if f(x) is not constant, then there are infinitely many primes p such that \(f(x)\equiv 0\pmod p\) has a solution x.