English

An irreducibility criterion for polynomials over integers

Number Theory 2020-06-09 v1

Abstract

In this article, we consider the polynomials of the form f(x)=a0+a1x+a2x2++anxnZ[x],f(x)=a_0+a_1x+a_2x^2+\cdots+a_nx^n\in \mathbb{Z}[x], where a0=a1++an|a_0|=|a_1|+\dots+|a_n| and a0|a_0| 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.

Keywords

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

R2 v1 2026-06-23T10:14:12.356Z