Infinitely Many Carmichael Numbers in Arithmetic Progressions

Abstract

In this paper, we prove that for any $a,M\in \mathbb{N}$ with $(a,M)=1$, there are infinitely many Carmichael numbers $m$ such that $m\equiv a$ mod $M$

To appear in the Bulletin of the London Mathematical Society

Cited by in corpus (7)

• Strengthening the Baillie-PSW primality test
• There are infinitely many elliptic Carmichael numbers
• Generalizations of Carmichael numbers I
• Carmichael numbers and the sieve
• On the Carmichael rings, Carmichael ideals and Carmichael polynomials
• Some thoughts on pseudoprimes
• On Generalized Carmichael Numbers