Eisenstein Criterion: Irreducibility Test

  • Thread starter Thread starter Mr Davis 97
  • Start date Start date
Mr Davis 97
Messages
1,461
Reaction score
44

Homework Statement


Determine the irreducibility ##x^2 - 12##

Homework Equations

The Attempt at a Solution


By using ##p=3## we see that ##x^2 - 12## is irreducible, because 3 does not divide 1, and 9 does not divide 12. That's easy enough.
But what if I have ##x^2 - 16##? Obviously this is factorable, but using p=3, doesn't the Eisenstein criterion tell us that it is irreducible?
 
Physics news on Phys.org
Mr Davis 97 said:

Homework Statement


Determine the irreducibility ##x^2 - 12##

Homework Equations

The Attempt at a Solution


By using ##p=3## we see that ##x^2 - 12## is irreducible, because 3 does not divide 1, and 9 does not divide 12. That's easy enough.
But what if I have ##x^2 - 16##? Obviously this is factorable, but using p=3, doesn't the Eisenstein criterion tell us that it is irreducible?
No, because you cannot apply Eisenstein here: ##3 \nmid 16 = a_0##.
 
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