ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let MM be a positive integer, and let aa be an integer such that (a,M)=1(a,M)=1. A Carmichael numbers in arithmetic progressions conjecture. There are infinitely many Carmichael numbers mm such that

m≡a(modM).m\equiv a\pmod M.

The paper's abstract states that this result is proved, so the conjecture is resolved by the paper itself.

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.