ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A Carmichael number is a composite number nn satisfying

an≡a(modn)a^n\equiv a\pmod n

for every a∈Za\in\mathbb Z. For R∈NR\in\mathbb N with R≥3R\geq 3, consider Carmichael numbers having exactly RR prime factors.

Carmichael's fixed-prime-factor infinitude conjecture. For any R∈NR\in\mathbb N with R≥3R\geq 3, there exist infinitely many Carmichael numbers with RR prime factors.

Carmichael numbers are known to be infinite, but the existence of infinitely many with each prescribed number of prime factors remains a central open problem. The paper obtains conditional results toward related questions.

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.