Carmichael number
In number theory, a Carmichael number is a composite number which satisfies the modular arithmetic congruence relation:
for all integers which are relatively prime to .^{[1]} They are named for Robert Carmichael. The Carmichael numbers are the subset K_{1} of the Knödel numbers.
Equivalently, a Carmichael number is a composite number for which
for all integers .^{[2]}
Contents
Overview[edit]
Fermat's little theorem states that if p is a prime number, then for any integer b, the number b^{p} − b is an integer multiple of p. Carmichael numbers are composite numbers which have this property. Carmichael numbers are also called Fermat pseudoprimes or absolute Fermat pseudoprimes. A Carmichael number will pass a Fermat primality test to every base b relatively prime to the number, even though it is not actually prime. This makes tests based on Fermat's Little Theorem less effective than strong probable prime tests such as the Baillie–PSW primality test and the Miller–Rabin primality test.
However, no Carmichael number is either an Euler–Jacobi pseudoprime or a strong pseudoprime to every base relatively prime to it^{[3]} so, in theory, either an Euler or a strong probable prime test could prove that a Carmichael number is, in fact, composite.
Arnault^{[4]} gives a 397-digit Carmichael number that is a strong pseudoprime to all prime bases less than 307:
where
- 29674495668685510550154174642905332730771991799853043350995075531276838753171770199594238596428121188033664754218345562493168782883
is a 131-digit prime. is the smallest prime factor of , so this Carmichael number is also a (not necessarily strong) pseudoprime to all bases less than .
As numbers become larger, Carmichael numbers become increasingly rare. For example, there are 20,138,200 Carmichael numbers between 1 and 10^{21} (approximately one in 50 trillion (5·10^{13}) numbers).^{[5]}
Korselt's criterion[edit]
An alternative and equivalent definition of Carmichael numbers is given by Korselt's criterion.
- Theorem (A. Korselt 1899): A positive composite integer is a Carmichael number if and only if is square-free, and for all prime divisors of , it is true that .
It follows from this theorem that all Carmichael numbers are odd, since any even composite number that is square-free (and hence has only one prime factor of two) will have at least one odd prime factor, and thus results in an even dividing an odd, a contradiction. (The oddness of Carmichael numbers also follows from the fact that is a Fermat witness for any even composite number.) From the criterion it also follows that Carmichael numbers are cyclic.^{[6]}^{[7]} Additionally, it follows that there are no Carmichael numbers with exactly two prime factors.
Discovery[edit]
Korselt was the first who observed the basic properties of Carmichael numbers, but he did not give any examples. In 1910, Carmichael^{[8]} found the first and smallest such number, 561, which explains the name "Carmichael number".
That 561 is a Carmichael number can be seen with Korselt's criterion. Indeed, is square-free and , and .
The next six Carmichael numbers are (sequence A002997 in the OEIS):
These first seven Carmichael numbers, from 561 to 8911, were all found by the Czech mathematician Václav Šimerka in 1885^{[9]} (thus preceding not just Carmichael but also Korselt, although Šimerka did not find anything like Korselt's criterion).^{[10]} His work, however, remained unnoticed.
J. Chernick^{[11]} proved a theorem in 1939 which can be used to construct a subset of Carmichael numbers. The number is a Carmichael number if its three factors are all prime. Whether this formula produces an infinite quantity of Carmichael numbers is an open question (though it is implied by Dickson's conjecture).
Paul Erdős heuristically argued there should be infinitely many Carmichael numbers. In 1994 W. R. (Red) Alford, Andrew Granville and Carl Pomerance used a bound on Olson's constant to show that there really do exist infinitely many Carmichael numbers. Specifically, they showed that for sufficiently large , there are at least Carmichael numbers between 1 and .^{[12]}
Löh and Niebuhr in 1992 found some very large Carmichael numbers, including one with 1,101,518 factors and over 16 million digits. This has been improved to 10,333,229,505 prime factors and 295,486,761,787 digits,^{[13]} so the largest known Carmichael number is much greater than the largest known prime.
Properties[edit]
Factorizations[edit]
Carmichael numbers have at least three positive prime factors. For some fixed R, there are infinitely many Carmichael numbers with exactly R factors; in fact, there are infinitely many such R.^{[14]}
The first Carmichael numbers with prime factors are (sequence A006931 in the OEIS):
k | |
---|---|
3 | |
4 | |
5 | |
6 | |
7 | |
8 | |
9 |
The first Carmichael numbers with 4 prime factors are (sequence A074379 in the OEIS):
i | |
---|---|
1 | |
2 | |
3 | |
4 | |
5 | |
6 | |
7 | |
8 | |
9 | |
10 |
The second Carmichael number (1105) can be expressed as the sum of two squares in more ways than any smaller number. The third Carmichael number (1729) is the Hardy-Ramanujan Number: the smallest number that can be expressed as the sum of two cubes (of positive numbers) in two different ways.
Distribution[edit]
Let denote the number of Carmichael numbers less than or equal to . The distribution of Carmichael numbers by powers of 10 (sequence A055553 in the OEIS):^{[5]}
1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | |
0 | 0 | 1 | 7 | 16 | 43 | 105 | 255 | 646 | 1547 | 3605 | 8241 | 19279 | 44706 | 105212 | 246683 | 585355 | 1401644 | 3381806 | 8220777 | 20138200 |
In 1953, Knödel proved the upper bound:
for some constant .
In 1956, Erdős improved the bound to
for some constant .^{[15]} He further gave a heuristic argument suggesting that this upper bound should be close to the true growth rate of .
In the other direction, Alford, Granville and Pomerance proved in 1994^{[12]} that for sufficiently large X,
In 2005, this bound was further improved by Harman^{[16]} to
who subsequently improved the exponent to . ^{[17]}
Regarding the asymptotic distribution of Carmichael numbers, there have been several conjectures. In 1956, Erdős^{[15]} conjectured that there were Carmichael numbers for X sufficiently large. In 1981, Pomerance^{[18]} sharpened Erdős' heuristic arguments to conjecture that there are at least
Carmichael numbers up to , where .
However, inside current computational ranges (such as the counts of Carmichael numbers performed by Pinch^{[5]} up to 10^{21}), these conjectures are not yet borne out by the data.
Generalizations[edit]
The notion of Carmichael number generalizes to a Carmichael ideal in any number field K. For any nonzero prime ideal in , we have for all in , where is the norm of the ideal . (This generalizes Fermat's little theorem, that for all integers m when p is prime.) Call a nonzero ideal in Carmichael if it is not a prime ideal and for all , where is the norm of the ideal . When K is , the ideal is principal, and if we let a be its positive generator then the ideal is Carmichael exactly when a is a Carmichael number in the usual sense.
When K is larger than the rationals it is easy to write down Carmichael ideals in : for any prime number p that splits completely in K, the principal ideal is a Carmichael ideal. Since infinitely many prime numbers split completely in any number field, there are infinitely many Carmichael ideals in . For example, if p is any prime number that is 1 mod 4, the ideal (p) in the Gaussian integers Z[i] is a Carmichael ideal.
Both prime and Carmichael numbers satisfy the following equality:
Higher-order Carmichael numbers[edit]
Carmichael numbers can be generalized using concepts of abstract algebra.
The above definition states that a composite integer n is Carmichael precisely when the nth-power-raising function p_{n} from the ring Z_{n} of integers modulo n to itself is the identity function. The identity is the only Z_{n}-algebra endomorphism on Z_{n} so we can restate the definition as asking that p_{n} be an algebra endomorphism of Z_{n}. As above, p_{n} satisfies the same property whenever n is prime.
The nth-power-raising function p_{n} is also defined on any Z_{n}-algebra A. A theorem states that n is prime if and only if all such functions p_{n} are algebra endomorphisms.
In-between these two conditions lies the definition of Carmichael number of order m for any positive integer m as any composite number n such that p_{n} is an endomorphism on every Z_{n}-algebra that can be generated as Z_{n}-module by m elements. Carmichael numbers of order 1 are just the ordinary Carmichael numbers.
An order 2 Carmichael number[edit]
According to Howe, 17 · 31 · 41 · 43 · 89 · 97 · 167 · 331 is an order 2 Carmichael number. This product is equal to 443,372,888,629,441.^{[19]}
Properties[edit]
Korselt's criterion can be generalized to higher-order Carmichael numbers, as shown by Howe.
A heuristic argument, given in the same paper, appears to suggest that there are infinitely many Carmichael numbers of order m, for any m. However, not a single Carmichael number of order 3 or above is known.
Notes[edit]
- ^ Riesel, Hans (1994). Prime Numbers and Computer Methods for Factorization. Progress in Mathematics. 126 (second ed.). Boston, MA: Birkhäuser. ISBN 978-0-8176-3743-9. Zbl 0821.11001.
- ^ Crandall, Richard; Pomerance, Carl (2005). Prime Numbers: A Computational Perspective (second ed.). New York: Springer. p. 133. ISBN 978-0387-25282-7.
- ^ D. H. Lehmer (1976). "Strong Carmichael numbers". J. Austral. Math. Soc. 21 (4): 508–510. doi:10.1017/s1446788700019364. Lehmer proved that no Carmichael number is an Euler-Jacobi pseudoprime to every base relatively prime to it. He used the term strong pseudoprime, but the terminology has changed since then. Strong pseudoprimes are a subset of Euler-Jacobi pseudoprimes. Therefore, no Carmichael number is a strong pseudoprime to every base relatively prime to it.
- ^ F. Arnault (August 1995). "Constructing Carmichael Numbers Which Are Strong Pseudoprimes to Several Bases". Journal of Symbolic Computation. 20 (2): 151–161. doi:10.1006/jsco.1995.1042.
- ^ ^{a} ^{b} ^{c} Pinch, Richard (December 2007). Anne-Maria Ernvall-Hytönen (ed.). The Carmichael numbers up to 10^{21} (PDF). Proceedings of Conference on Algorithmic Number Theory. 46. Turku, Finland: Turku Centre for Computer Science. pp. 129–131. Retrieved 2017-06-26.
- ^ Carmichael Multiples of Odd Cyclic Numbers "Any divisor of a Carmichael number must be an odd cyclic number"
- ^ Proof sketch: If is square-free but not cyclic, for two prime factors and of . But if satisfies Korselt then , so by transitivity of the "divides" relation . But is also a factor of , a contradiction.
- ^ R. D. Carmichael (1910). "Note on a new number theory function". Bulletin of the American Mathematical Society. 16 (5): 232–238. doi:10.1090/s0002-9904-1910-01892-9.
- ^ V. Šimerka (1885). "Zbytky z arithmetické posloupnosti (On the remainders of an arithmetic progression)". Časopis Pro Pěstování Matematiky a Fysiky. 14 (5): 221–225.
- ^ Lemmermeyer, F. (2013). "Václav Šimerka: quadratic forms and factorization". LMS Journal of Computation and Mathematics. 16: 118–129. doi:10.1112/S1461157013000065.
- ^ Chernick, J. (1939). "On Fermat's simple theorem" (PDF). Bull. Amer. Math. Soc. 45 (4): 269–274. doi:10.1090/S0002-9904-1939-06953-X.
- ^ ^{a} ^{b} W. R. Alford; Andrew Granville; Carl Pomerance (1994). "There are Infinitely Many Carmichael Numbers" (PDF). Annals of Mathematics. 139 (3): 703–722. doi:10.2307/2118576. JSTOR 2118576.
- ^ Shallue et al., arXiv:1203.6664.
- ^ Wright, Thomas (2016-06-01). "Factors of Carmichael numbers and a weak k-tuples conjecture". Journal of the Australian Mathematical Society. 100 (3): 421–429. doi:10.1017/S1446788715000427.
- ^ ^{a} ^{b} Erdős, P. (1956). "On pseudoprimes and Carmichael numbers" (PDF). Publ. Math. Debrecen. 4: 201–206. MR 0079031.
- ^ Glyn Harman (2005). "On the number of Carmichael numbers up to x". Bulletin of the London Mathematical Society. 37 (5): 641–650. doi:10.1112/S0024609305004686.
- ^ Harman, Glyn (2008). "Watt's mean value theorem and Carmichael numbers". International Journal of Number Theory. 4 (2): 241–248. doi:10.1142/S1793042108001316. MR 2404800.
- ^ Pomerance, C. (1981). "On the distribution of pseudoprimes". Math. Comp. 37 (156): 587–593. doi:10.1090/s0025-5718-1981-0628717-0. JSTOR 2007448.
- ^ Everett W. Howe (October 2000). "Higher-order Carmichael numbers". Mathematics of Computation. 69 (232): 1711–1719. arXiv:math.NT/9812089. Bibcode:2000MaCom..69.1711H. doi:10.1090/s0025-5718-00-01225-4. JSTOR 2585091.
References[edit]
- Carmichael, R. D. (1910). "Note on a new number theory function". Bulletin of the American Mathematical Society. 16 (5): 232–238. doi:10.1090/s0002-9904-1910-01892-9.
- Carmichael, R. D. (1912). "On composite numbers P which satisfy the Fermat congruence ". American Mathematical Monthly. 19 (2): 22–27. doi:10.2307/2972687. JSTOR 2972687.
- Chernick, J. (1939). "On Fermat's simple theorem" (PDF). Bull. Amer. Math. Soc. 45 (4): 269–274. doi:10.1090/S0002-9904-1939-06953-X.
- Korselt, A. R. (1899). "Problème chinois". L'Intermédiaire des Mathématiciens. 6: 142–143.
- Löh, G.; Niebuhr, W. (1996). "A new algorithm for constructing large Carmichael numbers" (PDF). Math. Comp. 65 (214): 823–836. Bibcode:1996MaCom..65..823L. doi:10.1090/S0025-5718-96-00692-8.
- Ribenboim, P. (1989). The Book of Prime Number Records. Springer. ISBN 978-0-387-97042-4.
- Šimerka, V. (1885). "Zbytky z arithmetické posloupnosti (On the remainders of an arithmetic progression)". Časopis Pro Pěstování Matematiky a Fysiky. 14 (5): 221–225.
External links[edit]
- Hazewinkel, Michiel, ed. (2001) [1994], "Carmichael number", Encyclopedia of Mathematics, Springer Science+Business Media B.V. / Kluwer Academic Publishers, ISBN 978-1-55608-010-4
- Table of Carmichael numbers
- Tables of Carmichael numbers below
- "The Dullness of 1729". MathPages.com.
- Weisstein, Eric W. "Carmichael Number". MathWorld.
- Final Answers Modular Arithmetic