A NOTE ON EISENSTEIN?S CRITERION FOR IRREDUCIBILITY OF POLYNOMIALS
We find a simple algorithm that will decide whether or not for a given polynomial A(x)of degree n with integer coefficients, there is a linear transformation where b ? 0and c are integers, such that the polynomial satisfies Eisenstein?s criterion with some prime p.
irreducibility test, Eisenstein?s criterion.