JP Journal of Algebra, Number Theory and Applications
Volume 5, Issue 3, Pages 603 - 608
(December 2005)
|
|
A NOTE ON EISENSTEIN?S CRITERION FOR IRREDUCIBILITY OF POLYNOMIALS
Martin Juráš (U. S. A.)
|
Abstract: 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. |
Keywords and phrases: irreducibility test, Eisenstein?s criterion. |
|
Number of Downloads: 470 | Number of Views: 1215 |
|