ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn be a nonnegative integer, and interpret “n=0n=0 or 11 mod 33” as n≡0n\equiv 0 or 1(mod3)1\pmod{3}. Compositeness conjecture. The integer

1+3⋅220n1+3\cdot 2^{20n}

is not prime for every n≡0n\equiv 0 or 1(mod3)1\pmod{3}. 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.