Abstract

In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing some sufficiency conditions on their coefficients along with some conditions on the prime factorization of the constant term or the leading coefficient of the underlying polynomials in conjunction with the information about their root location.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call