The pseudoprimes to 25 109

Mathematics of Computation

Volumn 35, Issue 151, 1980, Pages 1003-1026

  Pomerance, Carl ^a   Selfridge, J L ^b   Wagstaff, Samuel S ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b Mathematical Reviews   (United States)

Author keywords

Carmichael number; Euler pseudoprime; Lucas sequence; Primality testing; Pseudoprime; Strong pseudoprime

Indexed keywords

EID: 84966228376     PISSN: 00255718     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0025-5718-1980-0572872-7     Document Type: Article

References (36)

1. N. C. ANKENY, Review #4935, Math. Rev., v. 21, 1959, p. 905.
2. R. J. BAILLIE, S. S. WAGSTAFF, "Lucas pseudoprimes," Math. Comp., v. 35, 1980, p. 000-000.
3. JOHN. BRILLHART, D. H. LEHMER, J. L. SELFRIDGE, "New primality criteria and factorizations of 2m 1," Math. Comp., v. 29, 1975, p. 620-647.
4. N. G. DE BRUIJN, "On the number of positive integers x and free of prime factors y," Nederl. Acad. Wetensch. Proc Ser. A, v. 54, 1951, p. 50-60.
5. R. D. CARMICHAEL, "On composite numbers P which satisfy the Fermt congruence aP_1 = 1 mod P," Amer. Math. Monthly, v. 19, 1912, p. 22-27.
6. A. SCHINZEL, "On primitive prime factors of a" - b"," Proc. Cambridge Philos. Soc, v. 58, 1962, p. 555-562.
7. P. ERDOS, "On the normal number of prime factors of p - 1 and some other related problems concerning Euler's 0-function," Quart. J. Math. Oxford Ser., v. 6, 1935, p. 205-213.
8. P. ERDOS, "On pseudoprimes and Carmichael numbers," Publ. Math. Debrecen, v. 4, 1956, p. 201-206.
9. P. ERDOS, A. RNYI, "Probabilistic methods in group theory," J. Analyse Math., v. 14, 1965, p. 127-138.
10. W. KNODEL, "Carmichaelsche Zahlen," Math. Nachr., v. 9, 1953, p. 343-350.
11. EMMA. LEHMER, "On the infinitude of Fibonacci pseudo-primes," Fibonacci Quart., v. 2, 1964, p. 229-230.
12. D. H. LEHMER, "On the converse of Fermat's theorem. II," Amer. Math. Monthly, v. 56, 1949, p. 300-309.
13. D. H. LEHMER, "Strong Carmichael numbers," J. Austral. Math. Soc. Ser. A, v. 21, 1976, p. 508-510.
14. D. E. G. MALM, "On Monte-Carlo primality tests," Notices Amer. Math. Soc, v. 24, 1977, p. 529;
15. G. L. MILLER, "Riemann's Hypothesis and tests for primality," Proc. Seventh Annual ACM Symposium on the Theory of Computing, 1975, Albuquerque, p. 234-239.
16. L. MIRSKY, "The number of representations of an integer as a sum of a prime and a fc-free integer," Amer. Math. Monthly, v. 56, 1949, p. 17-19.
17. E. A. PARBERRY, "On primes and pseudo-primes related to the Fibonacci sequence," Fibonacci Quart, v. 8, 1970, p. 49-60.
18. P. POULET, "Table des nombres composs vrifiant le thorme de Fermt pour lemodule 2 jusqu' 100 000 000," Sphinx, v. 8, 1938, p. 42-52
19. MICHAEL O. RABIN, "Probabilistic algorithms," in Symposium on New Directions and Recent Results in Algorithms and Complexity (J. F. Traub, Ed.), Academic Press, New York, 1976, p. 21-39.
20. B. ROSSER, "The n-th prime is greater than n log n," Proc London Math. Soc (2), V. 45, 1939, p. 21-44.
21. A. ROTKIEWICZ, "Sur les progressions arithmtiques et gomtriques formes de trios nombres pseudopremiers distincts," Acta Arith., v. 10, 1964, p. 325-328.
22. D. SHANKS, Solved and Unsolved Problems in Number Theory, 2nd ed., Chelsea, New York, 1978.
23. R. SOLOVAY, V. STRASSEN, "A fast Monte-Carlo test for primality," SIAM J. Comput., v. 6, 1977, p. 84-85.
24. J. D. SWIFT, "Table of Carmichael numbers to 109," Math. Comp., v. 29, 1975, p.338-339.
25. K. SZYMICZEK, "On pseudoprimes which are products of distinct primes," A mer. Math. Monthly, v. 74, 1967, p. 35-37.
26. S. S. WAGSTAFF, "Pseudoprimes and a generalization of Artin's conjecture." Acta Arith. (To appear.)
27. M. YORINAGA, "A technique of numerical production of a sequence of pseudo-prime numbers," Math. J. Okayama Univ., v. 19, 1976, p. 1-4
28. M. YORINAGA, "On a congruencial property of Fibonacci numbers-numerical experiments," Math. J. Okayama Univ., v. 19, 1976, p. 5-10
29. M. YORINAGA, "On a congruencial property of Fibonacci numbers-considerations and remarks," Math. J. Okayama Univ., v. 19, 1976, p. 11-17.
30. A. ROTKIEWICZ, "On the number of pseudoprimes x," Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. Fiz., 1972, p. 43-45.
31. A. ROTKIEWICZ, "On the pseudoprimes with respect to the Lucas sequences," Bull. Acad. Polon. Sei Sr. Sei Math. Astronom. Phys., v. 21, 1973, p. 793-797.
32. H. C. WILLIAMS, "On numbers analogous to the Carmichael numbers," Canad. Math. Bull, v. 20, 1977, p. 133-143.
33. D. H. LEHMER, "An extended theory of Lucas functions," Ann of Math., v. 31, 1930, p. 419-448.
34. J. BRILLHART, J. TONASCIA, P. WEINBERGER, "On the Fermt quotient," Computers in Number Theory, Academic Press, London, 1971, p. 213-222.
35. H. C. WILLIAMS, "Primality testing on a computer," Ars Combin., v. 5, 1978, p. 127-185
36. P. ERDOS, "On the converse of Fermat's theorem," Amer. Math. Monthly, v. 56, 1949, p. 623-624.