An irreducibility criterion for polynomials over integers

preprint2019arXivOpen access

Abstract

In this article, we consider the polynomials of the form f(x)=a0+a1x+a2x2+⋯+anxn∈Z[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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.