Thread: Irreducible polynomials over Q

Let p be any prime number. Show that

1 + x + x^2/2! + x^3/3! ... + x^p/p! is irreducible over Q.

Okay for this one, I know that if the polynomial were degree 2 or 3 I could simply check whether it has roots, but I want to generalize to any prime p.

I would love to use Eisenstein Criterion, but because of the polynomial is not in Z[x] I cannot. I have spent a long time trying to convert the polynomial into a form that is usable. I came across an equation that said x^p -1/x-1 = 1+x+...+x^p-2+x^p-1. I have had no success so far.

I would really appreciate the help!

Originally Posted by curiousmuch

Let p be any prime number. Show that

1 + x + x^2/2! + x^3/3! ... + x^p/p! is irreducible over Q.

Okay for this one, I know that if the polynomial were degree 2 or 3 I could simply check whether it has roots, but I want to generalize to any prime p.

I would love to use Eisenstein Criterion, but because of the polynomial is not in Z[x] I cannot. I have spent a long time trying to convert the polynomial into a form that is usable. I came across an equation that said x^p -1/x-1 = 1+x+...+x^p-2+x^p-1. I have had no success so far.

I would really appreciate the help!

Actually you can use Eisenstien, but you need to fix it up first.

Gauss's lemma is the key that you need.

Let R be a Unique factorization domain with field of fractions F and let if p(x) is reducible in F[x] then p(x) is reducible in R[x].

What you actually want is the contraposative.

if p(x) is irreducible in R[x] then it is irreducable in F[x]

So in your case R is the integers and F is the rationals.

You should be able to finish from here

Happy hunting

Wow that is so useful! (we actually have never learned Gauss's lemma in class). Sorry but I'm still a bit confused how to look at the polynomial in Z[x]. Thanks a lot.

Originally Posted by curiousmuch

Wow that is so useful! (we actually have never learned Gauss's lemma in class). Sorry but I'm still a bit confused how to look at the polynomial in Z[x]. Thanks a lot.

so you have



multiply by to get





Note that all of the coeffeints are integers so now this is eisenstien in p so it is irreducable.

TheEmptySet's solution needs a little bit fixing:

let suppose was reducible over then would also be reducible over too. but by Eisenstein's criterion is irreducible over

and therefore irreducible over as well, by Gauss's lemma. contradiction!

Originally Posted by NonCommAlg

TheEmptySet's solution needs a little bit fixing:

let suppose was reducible over then would also be reducible over too. but by Eisenstein's criterion is irreducible over

and therefore irreducible over as well, by Gauss's lemma. contradiction!

Thanks

It seems that this is also true if is any positive integer, not just prime.

To use Eisentstein's criterion it needs to be the case that your polynomial is monic (although a stronger condition can be shown to work so long as p does not divide the leading term) and that p divides every other term, but does not divide the constant term. This is why it is critical that p be prime.

If p = 4 for instance you would have , so look at the coefficient, the only prime dividing 4 is 2, but so Eisenstein's criterion fails and this method no longer works.