The discussion centers on the application of the Eisenstein Criterion to determine the irreducibility of polynomials. Specifically, the polynomial ##x^2 - 12## is confirmed to be irreducible over the integers using the prime number 3, as 3 does not divide the leading coefficient (1) and 9 does not divide the constant term (12). Conversely, the polynomial ##x^2 - 16## is factorable, and the Eisenstein Criterion cannot be applied since 3 does not divide the constant term (16). This highlights the importance of correctly identifying applicable conditions for the criterion.
PREREQUISITESMathematics students, educators, and anyone studying abstract algebra or polynomial theory will benefit from this discussion, particularly those interested in irreducibility tests and their applications.
No, because you cannot apply Eisenstein here: ##3 \nmid 16 = a_0##.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?