Is it true that $\forall f \in \mathbb{Z}[x],\exists p$ prime number, s.t. $ f $ is reducible in $\mathbb{F}_p$? Is it true that $\forall f \in \mathbb{Z}[x],\exists p$  prime number, s.t. $ f $ is reducible in $\mathbb{F}_p$?
I've seen this problem before but I can't find it. And when I try to understand the picture of $\operatorname{Spec}(\mathbb{Z}[x])$. I want to have a certain answer about this problem
 A: Obviously this is not true for polynomials of degree $\leq 1$.  It is true for any polynomial $f$ of degree $>1$.  To prove this, suppose first that there exists $n\in\mathbb{Z}$ and a prime $p$ which does not divide the leading coefficient of $f$ such that $p\mid f(n)$.  Then when we reduce mod $p$, $x-n$ is a factor of $f$, and $f$ still has degree $>1$, so $f$ is reducible.
It remains to prove that such $n$ and $p$ exist.  Let $p_1,\dots,p_m$ be all the primes dividing the leading coefficient of $f$.  If no such $n$ and $p$ exist, then $f(n)$ has the form $\pm p_1^{d_1}\dots p_m^{d_m}$ for all $n\in\mathbb{Z}$.   Note that the number of numbers of this form in an interval $[-N,N]$ is at most $$2\cdot \prod_i \log_{p_i}(N)<C\log(N)^m$$ for some constant $C$.  On the other hand, if $f$ has degree $d$, then $|f(n)|$ grows like $n^d$ (within a constant factor) as $n$ gets large, and so the number of values of $f(n)$ in $[-N,N]$ must be at least $DN^{1/d}$ for some constant $D>0$.  When $N$ is sufficiently large, $DN^{1/d}>C\log(N)^m$, and so there must be some value $f(n)$ in $[-N,N]$ which does not have the form $\pm p_1^{d_1}\dots p_m^{d_m}$.
