Papers
Topics
Authors
Recent
Search
2000 character limit reached

An irreducibility criterion for polynomials over integers

Published 7 Jul 2019 in math.NT | (1907.03307v1)

Abstract: In this article, we consider the polynomials of the form $f(x)=a_0+a_1x+a_2x2+\cdots+a_nxn\in \mathbb{Z}[x],$ where $|a_0|=|a_1|+\dots+|a_n|$ and $|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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.