Conjecture on the compositeness of 1+3· 2^20n
Statement
Let be a nonnegative integer, and interpret “ or mod ” as or . Compositeness conjecture. The integer
is not prime for every or . The paper gives no proof or resolution of this assertion; it is presented as one of the authors’ conjectures in connection with the study of prime numbers and finite fields.
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.