• PART TWO: SYSTEMATIC APPROACH TO BASIC CONCEPTS OF POLYNOMIALS REDUCIBLE AND IRREDUCIBLE CRITERIONS OF POLYNOMIALS

Abstract

This paper explains reducible and irreducible criterions of n^th 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.