Classification conjecture for monomially irreducible integers
Statement
Let . An integer is monomially irreducible if it satisfies the monomial irreducibility property defined in the paper.
Classification conjecture. is monomially irreducible if and only if
or is prime.
The preceding results establish this classification for all monomially irreducible integers below and provide necessary conditions for odd integers. A complete classification remains 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.