Schönemann-Eisenstein-Dumas-type irreducibility conditions that use arbitrarily many prime numbers

From MaRDI portal
Publication:5501049




Abstract: The famous irreducibility criteria of Sch"onemann-Eisenstein and Dumas rely on information on the divisibility of the coefficients of a polynomial by a single prime number. In this paper we provide several irreducibility criteria of Sch"onemann-Eisenstein-Dumas-type for polynomials with integer coefficients, criteria that are given by some divisibility conditions for their coefficients with respect to arbitrarily many prime numbers. A special attention will be paid to those irreducibility criteria that require information on the divisibility of the coefficients by two distinct prime numbers.









This page was built for publication: Schönemann-Eisenstein-Dumas-type irreducibility conditions that use arbitrarily many prime numbers

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