Harrington's irreducibility conjecture for trinomial-like polynomials
Statement
Let and let
Harrington's conjecture. The polynomial is irreducible unless . The paper states that Zhang and Yuan provide an alternative proof using the Newton polygon technique, so the conjecture is solved.
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.