paper

An irreducibility criterion for polynomials over integers

arXiv:1907.03307

Abstract

In this article, we consider the polynomials of the form where and is a prime. We show that these polynomials have a cyclotomic factor whenever reducible. As a consequence, we give a simple procedure for checking the irreducibility of trinomials of this form and separability criterion for certain quadrinomials.

5 pages

An irreducibility criterion for polynomials over integers · wovepaper