Bremner and Ulas's reducibility-type conjecture for trinomials
Statement
Let , and let
be a trinomial of degree , where . A trinomial has reducibility type if it is a product of irreducible polynomials in with degrees .
Bremner and Ulas's conjecture. The reducibility type does not occur for .
The conjecture is part of the study of possible factor-degree patterns of trinomials. The source reports that the assertion remains a conjectural obstruction for degree .
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.