In another question I asked how I would find the miminal polynomial of a primitive nth root of unity over $\mathbb Q$, which was very well answered and easy to follow.
- Taking the same example, let $ζ_1$ be a primitive 21st root of 1. Find the minimal polynomial of $ζ_1$ over $\mathbb Q$.
$\Phi_{21}(x) = \dfrac{x^{21}-1}{\Phi_1(x) \Phi_3(x) \Phi_7(x)} = x^{12}-x^{11}+x^9-x^8+x^6-x^4+x^3-x+1$.
My questions are
what is the most effective way of dividing $x^{21}-1$ by $\Phi_1(x) \Phi_3(x) \Phi_7(x)$? All the ways I have been through are very long and arduous, so I was wondering if there is a more efficient way?
What is the best approach to finding the splitting field for this polynomial over $\mathbb Q$? I'm quite stuck on this, should I factorise then try to find the roots?
Any help would be amazing!
Polynmial division yields the result, if you know already $\Phi_1(x)=x-1$, $\Phi_3(x)=x^2+x+1$ and $\Phi_7(x)=x^6+\cdots +x+1$. First, start dividing by $x-1$, this is easy. Then divide by the next, and so on.
Otherwise, a very effective way is to use a factorisation algorithm for integer polynomials, yielding $$ x^{21}-1=(x^{12} - x^{11} + x^9 - x^8 + x^6 - x^4 + x^3 - x + 1)(x^6 + x^5 + x^4 + x^3 + x^2 + x + 1)(x^2 + x + 1)(x - 1). $$ The splitting field is, by definition, the cyclotomic field $\mathbb{Q}(\zeta_{21})$, of degree $12$ over $\mathbb{Q}$.