Carmichael number
Builds on Composite numberCoprime integersFermat pseudoprime
Definition
A Carmichael number is a composite number such that for each integer coprime to .
Remarks
Thus a Carmichael number is a Fermat pseudoprime to each base coprime to it. Korselt's criterion: a composite is a Carmichael number if and only if is square-free and for each prime . The smallest Carmichael number is . Here , and divide . Alford, Granville and Pomerance proved in 1994 that there are infinitely many Carmichael numbers.
Reading path
To understand this page from the ground up, read these 9 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Divisibility definition
- Congruence modulo n definition
- Greatest common divisor definition
- Prime number definition
- Coprime integers definition
- Fermat's little theorem statement
- Composite number definition
- Fermat pseudoprime definition
- Carmichael number definition
Further reading
About this page
| Tag | 0TA7WT68RK |
|---|---|
| URI | m2://0TA7WT68RK |
| Aliases | absolute-pseudoprime |
| Kind | definition |
| Writing | W1 stated |
| MSC | 11A51 |
| Defines | Carmichael number |
| Uses | Composite number, Coprime integers, Fermat pseudoprime |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge instance_of in: one example (0 of 1)
- edge not_instance_of in: one non-example that fails one clause (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.