Fix $f(x)\in\mathbb Z[x]$ a polynomial. For a given prime $p,$ we say $p$ is a "prime divisor" of $f$ if and only if $p$ divides $f(k)$ for some $k\in\mathbb Z.$ It is known that nonconstant $f$ have infinitely many prime divisors, and one can even exhibit polynomials $f$ with fun properties; for example $$p\;\;\text{divides}\;\;\Phi_n(nx)\implies p\equiv1\pmod n,$$ where $\Phi_n(x)\in\mathbb Z[x]$ is the $n$th cyclotomic polynomial. One can even show, using this, that every nonconstant polynomial $f$ have infinitely many $1\pmod n$ prime divisors. (See discussion after Theorem 3 here.) Explicitly, we can use Dedekind-Kummer to take all but finitely many of the primes which split completely in the closure of $\mathbb Q(\zeta_n)$ and $\mathbb Q(\alpha)$ where $\alpha\in\mathbb C$ is a root of $f.$
Showing the general case, however, looks harder. The question is as follows.
For nonconstant polynomials $f(x)\in\mathbb Z[x],$ are there infinitely many $k\pmod n$ prime divisors, for any $n,k\in\mathbb N$ with $\gcd(k,n)=1$?
In particular, I suspect that purely "algebraic" techniques (even allowing, say, Dedekind-Kummer) are insufficient here, but I have no strong reason to believe this.
Actually, the question is false for somewhat easy reasons, as was pointed out to me: the polynomial $\Phi_n(nx)$ itself fails to hit every single$\pmod n$ class except for $1\pmod n$ and so provides a counterexample. The revised question, then, is for a classification of which modular classes of primes are hit infinitely often.
For nonconstant polynomials $f(x)\in\mathbb Z[x],$ when are there infinitely many $k\pmod n$ prime divisors, for given $n,k\in\mathbb N$ with $\gcd(k,n)=1$?