Koley and Reddy's irreducibility conjecture for integer polynomials
Koley and Reddy's irreducibility conjecture for integer polynomials
Let , where for a prime and positive integer . Suppose that for a prime . Koley and Reddy's conjecture. If , , and
then is irreducible over . 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
Sign in to submit a solution.
No solutions have been posted yet.