Cloitre's prime-or-one conjecture for the least-common-multiple sequence
Statement
Define
and, for , define . The sequence consists of positive integers. Cloitre's conjecture. For any , is either or a prime number. Numerical evidence supports the conjecture, but the paper states that no proof is known; a sufficient condition is related to Linnik's theorem.
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.