Trying to prove that the following polynomial is irreducible in $\mathbb Q[x]$:
$x^4-16x^3+20x^2+12$
What I have tried:
1.) Eisenstein's Criterion, but there exists no suitable prime.
2.) reducing to modulo 2, 3, 5 ,7, 11, but by my calculations, reduction to mod 2, mod 3, mod 5, mod 7, yields a reducible polynomial. Mod 11 seems like it could potentially work, but I can't believe that would be the correct approach, given the sheer number of potential quadratic factors one would have to check.
3.) This polynomial fails the rational roots test, so I know that the only possible factors would involve second degree polynomials. Guided by some of the previous posts on related questions, I have attempted to work out some type of contradiction by assuming the polynomial can be factored like $(x^2+ax+b)(x^2+cx+d)$, but I haven't had much luck with this approach.
I imagine I'm staring at something obvious but can not see it. Any help would be appreciated.
Note that any factorization will be of the form: $$x^4 -16x^3+20x^2+12 = (x^2+2ax+2b)(x^2+2cx+2d)$$ Here $a,b,c,d$ are integers. We have used Gauss' lemma to note that if $f(x)$ is reducible over $\Bbb Q$ then it is reducible over $\Bbb Z$. The factors of two come from the fact that after reducing mod $2$, our factorization must turn into a factorization of $x^4$.
Expanding our expression gives us the following equations to be satisfied. $$\begin{align*} 2a + 2c &= -16\\ 2b+2d + 4ac &= 20\\ 4bc+4ad &= 0\\ 4bd &= 12 \end{align*}$$ The last of these implies that the pair $\{b,d\}$ is either $\{1,3\}$ or $\{-1, -3\}$. From this setup it is elementary to check that no choice of integers will work