I have some problems with this exercise. I don't know if it can be done.
Consider the polynomial $ x^n - a \in \mathbb{Q}[x]$. Can I compute the Galois group of this over $\mathbb{Q}$?
Maybe having a nice basis. The splitting field is given by $\mathbb{Q}(\zeta_n,\alpha)$, where $\zeta_n$ is a primitive root of unity, and $\alpha$ is some number such that $\alpha^n = a $. First of all, I want a good basis for the splitting field. In the sense that the minimal polynomials of the adjoined elements are different (in this case the computation of the Galois group is very simple).
For example, an easy case it's when $a>0$, then $a^{\frac{1}{n}} \in \mathbb{R}$, so clearly the minimal polynomials of $a^{\frac{1}{n}}$, respectively $\zeta_n$ are distinct, and I'm done. If $n$ is odd, then it's also easy, since one root it's also real, for example $x^3+3,a=-3$, the real root is $ \root 3 \of { - 3} = - \root 3 \of 3 $, so I can consider the splitting field as $\mathbb{Q}(-\root 3 \of 3 , \zeta_3 )=\mathbb{Q}(\root 3 \of 3 , \zeta_3 )$. The difficult case is when $n$ is even and $a<0$, for example $x^8+20$ or $x^4+20$. In some cases, as in the second, there are particular cases since there exist algorithms for the Galois group of quartics, but in general it can be done?
Remark. I'm searching a good basis for the splitting field. In the sense that the minimal polynomials of the adjoined elements, are different, since in this case the computation of the Galois group is very simple.