Revisiting Eisenstein-type criterion over integers

MaRDI QIDQ6281067zbMATH OpenFDO

Authors Akash Jena, Binod K. Sahoo

Publication date 13 December 2016

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Polynomials over commutative rings (13B25)

Abstract: The following result, a consequence of Dumas criterion for irreducibility of polynomials over integers, is generally proved using the notion of Newton diagram: Let $f(x)$ be a polynomial with integer coefficients and $k$ be a positive integer relatively prime to the degree of $f(x)$. Suppose that there exists a prime number $p$ such that the leading coefficient of $f(x)$ is not divisible by $p$, all the remaining coefficients are divisible by $p^k$, and the constant term of $f(x)$ is not divisible by $p^{k+1}$. Then $f(x)$ is irreducible over $mathbbZ$. For $k=1$, this is precisely the Eisenstein criterion. The aim of this article is to give an alternate proof, accessible to the undergraduate students, of this result for $kin2,3,4$ using basic divisibility properties of integers.

Recommendations

• On a mild generalization of the Schönemann-Eisenstein-Dumas irreducibility criterion
• Eisenstein-Dumas criterion for irreducibility of polynomials and projective transformations of the independent variable
• Schönemann-Eisenstein-Dumas-type irreducibility conditions that use arbitrarily many prime numbers
• A simple generalization of the Schönemann-Eisenstein irreducibility criterion
• A generalization of Eisenstein-Schönemann's irreducibility criterion

This page was built for publication: Revisiting Eisenstein-type criterion over integers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6281067)