2000 character limit reached
A note on an irreducible class of polynomials over integers
Published 7 Mar 2023 in math.NT | (2303.03605v1)
Abstract: In this note, we prove an irreducibility criterion for the polynomial of the form $f(x) = a_{n}x{n} + a_{n-1}x{n-1} + \cdots + a_{m}x{m} + p{u} \in \mathbb{Z}[x]$, where $p$ is a prime number, $u \geqslant 1$, $\gcd(u, m) = 1$, $p \nmid a_{m}$ and $p{u} > |a_{n}| + |a_{n-1}| + \cdots + |a_{m}|$. In particular, we show that the conjecture of Koley and Reddy is true.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.