I want to determine the minimal polynomial of $\sqrt{2}+\sqrt{3}$ over $\mathbb{Q}$.
I calculated the polynomial $x^4-10x^2+1$.
Now I used Eisensteins theorem to test if it is irreducible. It is not applicable in this form so I substituted $x$ with $x+1$.
$(x+1)^4 -10(x+1)^2 +1$
$x^4+4x^3 -4x^2 - 16x -8$
Here the prime $2$ divides all coefficient but the one of $x^4$ and by Eisensteins Theorem the polynomial is therefore irreducible over $\mathbb{Q}$.
But is this sufficient, I guess that it might still be reducible having coefficients of $\sqrt{2}$ or $\sqrt{3}$?
How can I test it for this numbers or am I on the wrong path and need to test it in another way?
A standard approach consists in going through the following steps. Set $E = \mathbb{Q}(\sqrt{2}, \sqrt{3})$.