The Carmichael numbers up to $10^ {15}$
HTML articles powered by AMS MathViewer
- by R. G. E. Pinch PDF
- Math. Comp. 61 (1993), 381-391 Request permission
Abstract:
There are 105212 Carmichael numbers up to ${10^{15}}$: we describe the calculations. The numbers were generated by a back-tracking search for possible prime factorizations, and the computations checked by searching selected ranges of integers directly using a sieving technique, together with a "large-prime variation".References
- W. R. Alford, Andrew Granville, and Carl Pomerance, There are infinitely many Carmichael numbers, Ann. of Math. (2) 139 (1994), no. 3, 703–722. MR 1283874, DOI 10.2307/2118576
- N. G. W. H. Beeger, On composite numbers $n$ for which $a^{n-1}\equiv (\textrm {mod}\,n)$ for every $a$ prime to $n$, Scripta Math. 16 (1950), 133–135. MR 36773
- R. D. Carmichael, Note on a new number theory function, Bull. Amer. Math. Soc. 16 (1910), no. 5, 232–238. MR 1558896, DOI 10.1090/S0002-9904-1910-01892-9
- R. D. Carmichael, On Composite Numbers $P$ Which Satisfy the Fermat Congruence $a^{P-1} \equiv 1 \operatorname {mod} P$, Amer. Math. Monthly 19 (1912), no. 2, 22–27. MR 1517641, DOI 10.2307/2972687 I. Damgård and P. Landrock, Improved bounds for the Rabin primality test, preprint, 12 March 1992, Coding and Cryptography III, Proc. 3rd IMA Conf. on Coding and Cryptography (M. Ganley, ed.), Cirencester, December 1991 (to appear).
- Ivan Damgård, Peter Landrock, and Carl Pomerance, Average case error estimates for the strong probable prime test, Math. Comp. 61 (1993), no. 203, 177–194. MR 1189518, DOI 10.1090/S0025-5718-1993-1189518-9 J. H. Davenport, Primality testing revisited, preprint, 20 April 1992, Proceedings ISSAC 1992 (P. S. Wang, ed.), ACM, New York, 1992.
- Adina Di Porto and Piero Filipponi, A probabilistic primality test based on the properties of certain generalized Lucas numbers, Advances in cryptology—EUROCRYPT ’88 (Davos, 1988) Lecture Notes in Comput. Sci., vol. 330, Springer, Berlin, 1988, pp. 211–223. MR 994664, DOI 10.1007/3-540-45961-8_{1}8
- H. J. A. Duparc, On Carmichael numbers, Simon Stevin 29 (1952), 21–24. MR 48492 A. Granville, Primality testing and Carmichael numbers, Notices Amer. Math. Soc. 39 (1992), 696-700. D. Guillaume, Table des nombres de Carmichael inférieurs à ${10^{12}}$, preprint, May 1991. A. Guthmann, On the computation of Carmichael numbers, Universität Kaiserslautern, preprint 218, April 1992.
- Gerhard Jaeschke, The Carmichael numbers to $10^{12}$, Math. Comp. 55 (1990), no. 191, 383–389. MR 1023763, DOI 10.1090/S0025-5718-1990-1023763-5 W. Keller, The Carmichael numbers to ${10^{13}}$, Abstracts Amer. Math. Soc. 9 (1988), 328-329.
- Walter Knödel, Carmichaelsche Zahlen, Math. Nachr. 9 (1953), 343–350 (German). MR 55360, DOI 10.1002/mana.19530090603
- Rudolf Lidl and Winfried B. Müller, A note on strong Fibonacci pseudoprimes, Advances in cryptology—AUSCRYPT ’90 (Sydney, 1990) Lecture Notes in Comput. Sci., vol. 453, Springer, Berlin, 1990, pp. 311–317. MR 1083782, DOI 10.1007/BFb0030371
- Rudolf Lidl, Winfried B. Müller, and Alan Oswald, Some remarks on strong Fibonacci pseudoprimes, Appl. Algebra Engrg. Comm. Comput. 1 (1990), no. 1, 59–65. MR 1325512, DOI 10.1007/BF01810848 F. J. McDonnell, Rabin’s algorithm and the proportion of ’liars’ for various families of numbers, University of Warwick, preprint, March 1989.
- Winfried B. Müller and Alan Oswald, Dickson pseudoprimes and primality testing, Advances in cryptology—EUROCRYPT ’91 (Brighton, 1991) Lecture Notes in Comput. Sci., vol. 547, Springer, Berlin, 1991, pp. 512–516. MR 1227820, DOI 10.1007/3-540-46416-6_{4}5 R. G. E. Pinch, The pseudoprimes up to ${10^{12}}$, preprint, June, 1992.
- Carl Pomerance, On the distribution of pseudoprimes, Math. Comp. 37 (1981), no. 156, 587–593. MR 628717, DOI 10.1090/S0025-5718-1981-0628717-0 —, Two methods in elementary analytic number theory, Number Theory and Applications (R. A. Mollin, ed.), Kluwer, Dordrecht, 1989.
- Carl Pomerance, J. L. Selfridge, and Samuel S. Wagstaff Jr., The pseudoprimes to $25\cdot 10^{9}$, Math. Comp. 35 (1980), no. 151, 1003–1026. MR 572872, DOI 10.1090/S0025-5718-1980-0572872-7
- Paulo Ribenboim, The book of prime number records, Springer-Verlag, New York, 1988. MR 931080, DOI 10.1007/978-1-4684-9938-4
- Paulo Ribenboim, The little book of big primes, Springer-Verlag, New York, 1991. MR 1118843, DOI 10.1007/978-1-4757-4330-2
- J. D. Swift, Errata to D. H. Lehmer’s “Table errata: ‘Table des nombres composés vérifiant le théorème de Fermat pour le module 2 jusqu’à 100.000.000’ by P. Poulet” (Math. Comp. 25 (1971), no. 116, 944-945), Math. Comp. 26 (1972), 814. MR 655816, DOI 10.1090/S0025-5718-1972-0655816-4
- H. C. Williams, On numbers analogous to the Carmichael numbers, Canad. Math. Bull. 20 (1977), no. 1, 133–143. MR 447099, DOI 10.4153/CMB-1977-025-9
- Masataka Yorinaga, Numerical computation of Carmichael numbers, Math. J. Okayama Univ. 20 (1978), no. 2, 151–163. MR 519562
Additional Information
- © Copyright 1993 American Mathematical Society
- Journal: Math. Comp. 61 (1993), 381-391
- MSC: Primary 11Y11; Secondary 11Y70
- DOI: https://doi.org/10.1090/S0025-5718-1993-1202611-7
- MathSciNet review: 1202611