Opposite Eisenstein's criteria

  • Thread starter Thread starter lola1990
  • Start date Start date
  • Tags Tags
    Criteria
lola1990
Messages
30
Reaction score
0

Homework Statement


Homework Equations


The Attempt at a Solution

 
Last edited:
Physics news on Phys.org
Note, if you want to type in TeX, then you need to use the / slash. So it would have to be [ itex ] ... [ /itex ]

lola1990 said:

Homework Statement


Let f(x)=a_{n}x^{n}+...+a_{1}x+a_{0}. Let p be a prime and suppose p~|~ a_{i} for i in n,n-1...1 but p does not divide a_{0}. Show that if p^{2} does not divide a_{n}, then f(x) is irreducible.

Homework Equations


The Attempt at a Solution


Let f(x)=h(x)g(x) with h(x),g(x) in Z[x], and reduce mod p so that a_{0}=h(x)g(x). We have that if the leading coefficient of g(x) is g_{r} and the leading term of h(x) is h_{s} with r+s=n, p divides either coefficient but not both (because then the product would be divisible by p^{2}). Also, p does not divide the constant term of either polynomial. WLOG, suppose p divides g_{r} but not h_{s}. Now, I want to find a coefficient of f(x) so that I can force h_{s} to be divisible by p, but I'm not sure how... help!
 
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