A solution to the fun question in the last post
Sanath Devalapurkar
Recall the question: Show that and are irreducible over , but reducible in . First we try the standard methods; the rational root test shows that there aren’t any rational roots. Also, you can’t use Eisenstein here. So we’ll resort to Galois theory :o) The polynomial is the polynomial in the case , , and […]