Carmichael number: Difference between revisions

Revision as of 21:15, 15 January 2012

A composite number $n>1$ is termed an Carmichael number or absolute pseudoprime if it satisfies the following condition:

The universal exponent (also called the Carmichael function) $\lambda (n)$ of $n$ divides $n-1$ .
For any natural number $a$ relatively prime to $n$ , $n$ divides $a^{n-1}-1$ .
$n$ is a Fermat pseudoprime to any base relatively prime to it.

Note that Carmichael number is square-free and Carmichael number is odd, so each of these is the product of distinct odd primes. Further, because Carmichael number is not semiprime, there are at least three prime factors of each number. For the first few examples, we indicate the prime factors:

Carmichael number	Prime factors as list	3?	5?	7?	11?	13?	17?	19?	23?	29?	31?	Universal exponent (must divide number minus one)
561	3, 11, 17	Yes	No	No	Yes	No	Yes	No	No	No	No	80
1105	5, 13, 17	No	Yes	No	No	Yes	Yes	No	No	No	No	48
1729	7, 13, 19	No	No	Yes	No	Yes	No	Yes	No	No	No	36
2465	5, 17, 29	No	Yes	No	No	Yes	No	No	No	Yes	No	112
2821	7, 13, 31	No	No	Yes	No	Yes	No	No	No	No	Yes	60

@@ Line 34: / Line 34: @@
 * [[There are infinitely many Carmichael numbers]]
+* [[Carmichael number is odd]]
+* [[Carmichael number is square-free]]
+* [[Carmichael number is not semiprime]]