Koley and Reddy's irreducibility conjecture for integer polynomials

Let f=a0+a1x++anxnZ[x]f=a_0+a_1x+\cdots+a_nx^n\in\mathbb Z[x], where a0=±pka_0=\pm p^k for a prime pp and positive integer kk. Suppose that a1=a2==aq1=0a_1=a_2=\cdots=a_{q-1}=0 for a prime qnq\leq n. Koley and Reddy's conjecture. If paqanp\nmid a_qa_n, qkq\nmid k, and

pk>aq+aq+1++an,p^k>|a_q|+|a_{q+1}|+\cdots+|a_n|,

then ff is irreducible over Q\mathbb Q. The paper states that this conjecture follows from an earlier theorem, so it is solved rather than open.

Sources & referencesView supporting material

Primary source

Sanjeev Kumar and Jitender Singh, “A study of some recent irreducibility criteria for polynomials having integer coefficients”, arXiv:2310.02860 (2023).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.