Prove that $f=x^4-4x^2+16\in\mathbb{Q}$ is irreducible
The associated quadratic polynomial $t^2-4t+16$ has negative discriminant, so there's no real root. Then the polynomial can be factorized over the reals as a product of degree two polynomial. You get them by a process similar to completing the square: \begin{align} x^4-4x^2+16 &=x^4+8x^2+16-12x^2\\ &=(x^2+4)^2-(\sqrt{12}\,x)^2\\ &=(x^2-\sqrt{12}\,x+4)(x^2+\sqrt{12}\,x+4) \end{align} These two polynomials have negative discriminant (no need to verify it) and so they're irreducible in $\mathbb{R}[x]$. If the given polynomial were reducible over the rationals, the two factorizations in $\mathbb{Q}[x]$ and $\mathbb{R}[x]$ would coincide.
Therefore the given polynomial is irreducible over the rationals.
What's the general rule? Suppose you have $x^4+px^2+q$, with $p,q$ integers and $p^2-4q<0$ (so $q>0$). Write $q=r^2$, with $r>0$ (it need not be integer), and $$ x^4+px^2+q=x^4+2rx^2+r^2-(2r-p)x^2 $$ Note that $2r-p>0$: it's obvious if $p<0$; if $p\ge0$ it's the same as $4q>p^2$, which is true by hypothesis. Then $$ x^4+px^2+q=(x^2-\sqrt{2r-p}\,x+r)(x^2+\sqrt{2r-p}\,x+r) $$ is the decomposition of the polynomial in $\mathbb{R}[x]$. It is in $\mathbb{Q}[x]$ if and only if $\sqrt{q}$ and $\sqrt{2\sqrt{q}-p}$ are integers.
For example, $q=4$ and $p=0$ is a case. For $q=16$ we need $8-p$ to be a square, so $q=16$ and $p=4$ is another case.
The polynomial has no real roots, because it is equal to $(x^2-2)^2+12$. The remaining possibility is thus that it is a product of two quadratic factors. By Gauss' Lemma these need to have integer coefficients, so we are looking for a possibile factorization like $$ p(x)=x^4-4x^2+16=(x^2+ax+b)(x^2+cx+d) $$ with some integers $a,b,c,d$. Modulo $3$ we have the factorization $$p(x)=(x^2-2)^2+12\equiv(x^2+1)^2.$$ Therefore $a$ and $c$ must both be divisible by three, and $b\equiv d\equiv 1\pmod3$. Modulo $5$ we have $$ p(x)\equiv x^4+x^2+1=(x^2+1)^2-x^2=(x^2+x+1)(x^2-x+1). $$ This means that $b\equiv d\equiv1\pmod 5$ as well. The Chinese Remainder Theorem (or case-by-case check) then shows that $b\equiv d\equiv 1\pmod{15}$.
Because $bd=16$ the only remaining possibility is that they are $1$ and $16$ in some order. But this is impossible because modulo $2$ we have $$p(x)\equiv x^4,$$ so all of $a,b,c,d$ must be even.
The conclusion is that $p(x)$ is irreducible.
Below is an explicit proof. Note that $x^4-4x^2+16 = (x^2-2)^2 + 12$, which clearly has no real root. Hence, the only possible way to reduce $x^4-4x^2+16$ over $\mathbb{Q}$ is $(x^2+ax+b)(x^2+cx+d)$. However, the roots of $x^4-4x^2+16$ are $x = \pm \sqrt{2 \pm i\sqrt{12}}$, which are all complex numbers. Since complex roots occur in conjugate pairs, $\sqrt{2 \pm i\sqrt{12}}$ must be the roots of one of the factored quadratic. Hence, the factored quadratic must be $$x^2-(\sqrt{2+i\sqrt{12}}+\sqrt{2-i\sqrt{12}})x + \sqrt{2+ i\sqrt{12}}\sqrt{2- i\sqrt{12}} = x^2-2\sqrt3 x+4$$ The other factored quadratic must be $$x^2+(\sqrt{2+i\sqrt{12}}+\sqrt{2-i\sqrt{12}})x + \sqrt{2+ i\sqrt{12}}\sqrt{2- i\sqrt{12}} = x^2+2\sqrt3 x+4$$ Hence, $x^4-4x^2+16$ is irreducible over $\mathbb{Q}$.