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.
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top