Statements (24)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
composite number |
| gptkbp:definedIn |
a composite number n such that b^(n−1) ≡ 1 (mod n) for all integers b coprime to n
|
| gptkbp:discoveredBy |
561
|
| gptkbp:example |
1729
561 1105 6601 2821 2465 |
| gptkbp:firstPublished |
1910
|
| https://www.w3.org/2000/01/rdf-schema#label |
Carmichael number
|
| gptkbp:infinite |
yes
|
| gptkbp:namedAfter |
gptkb:Robert_Carmichael
|
| gptkbp:property |
has at least three prime factors
pseudoprime to every base coprime to it square-free all prime divisors p of n satisfy (p-1) divides (n-1) satisfies Fermat's little theorem for all coprime bases |
| gptkbp:provenInfiniteBy |
gptkb:Alford,_Granville,_and_Pomerance_(1994)
|
| gptkbp:sequence |
gptkb:A002997_(OEIS)
|
| gptkbp:usedIn |
number theory
|
| gptkbp:bfsParent |
gptkb:Robert_Daniel_Carmichael
|
| gptkbp:bfsLayer |
6
|