• PART TWO: SYSTEMATIC APPROACH TO BASIC CONCEPTS OF POLYNOMIALS REDUCIBLE AND IRREDUCIBLE CRITERIONS OF POLYNOMIALS
Abstract
This paper explains reducible and irreducible criterions of nth degree polynomials using the order of polynomials. Here to recall that, the existing Eisenstein's irreducibility Criterion of polynomial over the field ℚ of rational numbers works only for those polynomials which satisfy his condition, but still there are irreducible polynomials over the field of rational numbers which do not satisfy any other methods including Eisenstein's Irreducibility Criterion. Therefore, I extend some general irreducibility criterions of polynomials from their order of polynomials.
Keywords
Full Text:
pdfThis work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2022 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |