Papers
Topics
Authors
Recent
Search
2000 character limit reached

Another irreducibility criterion

Published 31 Dec 2022 in math.NT and math.AG | (2301.00107v1)

Abstract: Let $f=a_0+ a_{1}x+\cdots+a_m xm\in \Bbb{Z}[x]$ be a primitive polynomial. Suppose that there exists a positive real number $\alpha$ such that $|a_m| \alpham>|a_0|+|a_1|\alpha+\cdots+|a_{m-1}|\alpha{m-1}$. We prove that if there exist natural numbers $n$ and $d$ satisfying $n\geq \alpha+ d$ for which either $|f(n)|/d$ is a prime, or $|f(n)|/d$ is a prime-power coprime to $|f'(n)|$, then $f$ is irreducible in $\mathbb{Z}[x]$.

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.

Authors (2)

Collections

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