General irreducibility conjecture for integer polynomials with prime-power constant term
Statement
Let and be prime numbers, let , and let
Irreducibility conjecture. If , , and
then is irreducible over . This conjecture seeks a common irreducibility criterion extending the preceding results for the cases , , and ; its resolution is not given here.
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.