Carmichael Numbers
Carmichael Numbers is a special class of composite integers that satisfy Fermat's Little Theorem for all integers coprime to them, thereby mimicking prime numbers in modular arithmetic despite being non-prime.
24
Publications
870
Citations
36
Authors
25
Institutions
Publications per year
2017–2026
1
Parents
24
On pseudoprimes and Carmichael numbers
P. Erdős · Publicationes Mathematicae Debrecen · 2022 · 64 citations · Full text
The Carmichael numbers up to 10¹⁵
Richard G. E. Pinch · Mathematics of Computation · 1993 · 53 citations · Full text
1–5 of 24
36
5
h-index
4
h-index
4
h-index
2
h-index
2
h-index
1–5 of 36
25
University of Missouri
Columbia, United States
5 h-index
5 publications
102 citations

Macquarie University
Sydney, Australia
4 h-index
4 publications
81 citations

Royal Holloway University of London
Egham, United Kingdom
3 h-index
3 publications
73 citations
Universidad Nacional Autónoma de México
Mexico City, Mexico
2 h-index
3 publications
32 citations
Dartmouth College
Hanover, United States
2 h-index
2 publications
38 citations
Turku University of Applied Sciences
Turku, Finland
1 h-index
1 publications
14 citations

University of Turku
Turku, Finland
1 h-index
1 publications
14 citations
University of Cambridge
Cambridge, United Kingdom
1 h-index
1 publications
53 citations
1–8 of 25
MCOM · 5 publications · 131 citations
5
h-index
4 publications · 82 citations
4
h-index
3 publications · 58 citations
3
h-index
3 publications · 68 citations
3
h-index
1 publications · 64 citations
1
h-index
1–5