An irreducibility criterion for polynomials over integers
Number Theory
2020-06-09 v1
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.
Cite
@article{arxiv.1907.03307,
title = {An irreducibility criterion for polynomials over integers},
author = {Biswajit Koley and A. Satyanarayana Reddy},
journal= {arXiv preprint arXiv:1907.03307},
year = {2020}
}
Comments
5 pages