How to demonstrate that there is no all-prime generating polynomial with rational cofficents?

It seems like there is no polynomial with finite variables known, which could generate all prime numbers, by integer assignments. Is there a proof that such polynomial can not exist and does anyone have one in his/her stack?

In fact there does not even exist a non-constant polynomial $f$ (I assume you want integer coefficients) which only takes prime values with integer inputs. It suffices to prove this for polynomials in one variable. By the hypothesis that $f$ is non-constant, it takes arbitrarily large values, so without loss of generality $|f(0)| > 1$; in particular, $f(0)$ is divisible by some prime $p$. Then $f(kp)$ is always divisible by $p$, hence cannot be prime for sufficiently large $k$.

However, remarkably there do exist polynomials in more than one variable all of whose positive values are prime.

When is $2$ a quadratic residue mod $p$?

Prove that if a function $f$ has a jump at an interior point of the interval $[a,b]$ then it cannot be the derivative of any function.

Composition of 2 involutions

prove $\ln(1+x^2)\arctan x=-2\sum_{n=1}^\infty \frac{(-1)^n H_{2n}}{2n+1}x^{2n+1}$

A continuous bijection from a compact space to a $T_2$ space is always a homeomorphism

Computing second partial derivative with polar coordinates

Cauchy-Schwarz inequality proof (but not the usual one)

Summation of series $\sum_{n=1}^\infty \frac{n^a}{b^n}$?

What is the sum of the prime numbers up to a prime number $n$? [duplicate]

When $\operatorname{Hom}_{R}(M,N)$ is finitely generated as $\mathbb Z$-module or $R$-module?

Are there any simple ways to see that $e^z-z=0$ has infinitely many solutions?