Carmichael Numbers with Prime Numbers of Prime Factors
Abstract
Under the assumption of Heath-Brown's conjecture on the first prime in an arithmetic progression, we prove that there are infinitely many Carmichael numbers n such that the number of prime factors of n is prime.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.