Koley and Reddy's irreducibility conjecture for integer polynomials
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.