Integer polynomial on integer values: dense mod $\pi$? I was trying to answer the question at How to show that $\lim_{n \to \infty} \sin(n^2)$ does not exist?

I was able to show that $\sin(n^2)$ does not tend to a limit, but am still unable to show that $n^2$ itself is dense mod $\pi$. Can this be deduced in a straightforward way from the famous theorem that the integers are dense mod $\pi$? 

Also, are all integer polynomials dense modulus an irrational number? I struggle to find the relevant literature online.
Yes, I think so. Answering loosely: say we want an integer $n$ so that $n^2$ is "close to" a certain value $r$ mod $\pi$. Let $s = \sqrt{r}$. Because the integers are dense mod $\pi$, there is an integer $k$ so that $k$ is "close to" $s$. Let $n = k$. $n^2 \mathrm{mod} \pi = k^2 \mathrm{mod} \pi = (k \mathrm{mod} \pi)^2$. So $n^2$ is "close to" $s^2 = r$ mod $\pi$.
Yes, I think so. Answering loosely: say we want an integer $n$ so that $n^2$ is "close to" a certain value $r$ mod $\pi$. Let $s = \sqrt{r}$. Because the integers are dense mod $\pi$, there is an integer $k$ so that $k$ is "close to" $s$. Let $n = k$. $n^2 \mathrm{mod} \pi = k^2 \mathrm{mod} \pi = (k \mathrm{mod} \pi)^2$. So $n^2$ is "close to" $s^2 = r$ mod $\pi$.