Galois Theory - irreducibility over Q

  • Thread starter Thread starter Kate2010
  • Start date Start date
  • Tags Tags
    Theory
Kate2010
Messages
134
Reaction score
0

Homework Statement



If a>1 is a product of distinct primes, show that xn-a is irreducible over Q for all n ≥ 2.

Homework Equations





The Attempt at a Solution



I am not really sure how to start this problem. Can anyone point me in the right direction?

I know tests for irreducibility for example Eisensteins Criterion or reduction modulo p but I don't think that these are helpful here?

Thanks for any help.
 
Physics news on Phys.org
Hi Kate2010! :smile:

How about the rational root theorem?
 
I like Serena said:
Hi Kate2010! :smile:

How about the rational root theorem?

That would only tell you it doesn't have any linear factors. I'm a little confused why Kate2010 thinks Eisenstein's criterion isn't applicable.
 
Dick said:
That would only tell you it doesn't have any linear factors. I'm a little confused why Kate2010 thinks Eisenstein's criterion isn't applicable.

Right.
Just looked up Eisenstein's criterion.
Looks like a good one. :)
 
Thanks guys - I was trying to make things more complicated than they were.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top