Building pseudoprimes with a large number of prime factors

Applicable Algebra in Engineering, Communications and Computing

Volumn 7, Issue 4, 1996, Pages 263-277

  Guillaume, D ^a   Morain, F ^b  

^a Lab d'Info de l'Ecl Polytech E ^*  (France)

^b ÉCOLE POLYTECHNIQUE   (France)

Author keywords

Carmichael numbers; Elliptic pseudoprimes; Lucas pseudoprimes; Pseudoprimes; Strong Dickson pseudoprimes

Indexed keywords

CALCULATIONS; NUMBER THEORY; NUMERICAL METHODS; THEOREM PROVING;

CARMICHAEL NUMBERS; COMPOSITE INTEGERS; ELLIPTIC PSEUDOPRIMES; EXTENSION THEOREM; LUCAS PSEUDOPRIMES; PRIME FACTORS; PSEUDOPRIMES; STRONG DICKSON PSEUDOPRIMES; WILLIAMS PSEUDOPRIMES;

ALGEBRA;

EID: 0030169550     PISSN: 09381279     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01195532     Document Type: Article

References (42)

1. Alford, W. R., Granville, A., Pomerance, C.: There are infinitely many Carmichael numbers. Ann. Math. 139(3), 703-722 (May 1994)
2. Bedocchi, E.: Note on a conjecture on prime numbers. Rev. Math. Univ. Parma 4(11), 229-236 (1985)
3. m±1. Math. Comp. 29(130), 620-647 (1975)
4. Carmichael, R. D.: Note on a new number theory function. Bull AMS XVI, 232-238 (1910)
5. p-1 = 1 mod P. Am. Math. Monthly XIX, 22-27 (1912)
6. Chernick, J.: On Fermat's simple theorem. Bull. AMS 45, 269-274 (Apr. 1939)
7. Cohen, G. L., Hagis, Jr, P.: On the number of prime factors of n if φ(n)|(n - 1). Nieuw Archief voor Wiskunde (3) XXVIII, 177-185 (1980)
8. Dickson, L. E.: The analytic representation of substitutions on a power of a prime number of letters with a discussion of the linear group I. Ann. Math. 11, 65-120 (1896)
9. Dubner, H.: A new method for producing large Carmichael numbers. Math. Comp. 53(187), 411-414 (July 1989)
10. Erdös, P., Pomerance, C., Schmutz, E.: Carmichael's lambda function. Acta Arithmetica LVIII, 4, 363-385 (1991)
11. Giuga, G.: Su una presumbile proprietà caratteristica dei numeri primi. Ist. Lombardo Sci. Lett. Rend. Cl. Sci. Nat. 3, 14(83), 511-528 (1950)
12. Gordon, D. M.: On the number of elliptic pseudoprimes. Math. Comp. 52(185), 231-245 (Jan. 1989)
13. Gordon, D. M., Pomerance, C.: The distribution of Lucas and elliptic pseudoprimes. Math. Comp. 57(196), 825-838 (Oct. 1991)
14. Guillaume, D., Morain, F.: Building Carmichael numbers with a large number of prime factors. Research Report LIX/RR/92/01, Ecole Polytechnique-LIX, Feb. 1992
15. Guillaume, D., Morain, F.: Building Carmichael numbers with a large number of prime factors and generalization to other numbers. Research Report 1741, INRIA, Aug. 1992
16. 12. Math. Comp. 55(191), 383-389 (July 1990)
17. 13. AMS Abstracts 9, 328-329 (1988), Abstract 88T-11-150
18. Kishore, M.: On the number of district prime factors of n for which φ(n)|n - 1. Nieuw Archief voor Wiskunde (3) XXV, 48-53 (1977)
19. Kowol, G.: On strong Dickson pseudoprimes. AAECC 3, 129-138 (1992)
20. Lausch, H., Nöbauer, W.: Algebra of polynomials. North Holland, Amsterdam 1973
21. Lehmer, D. H.: An extended theory of Lucas' functions. Ann. Math. 31, 419-448 (1930). Series (2)
22. Lehmer, D. H.: On Euler's totient function. Bull. AMS 38, 745-751 (1932)
23. Lidl, R., Müllen, G. L., Turnwald, G.: Dickson polynomials, vol. 65 of Pitman Monographs and Surveys in Pure and Applied Mathematics. Longman Scientific & Technical, 1993
24. Lidl, R., Müller, W. B.: Primality testing with Lucas functions. In: Auscrypt '92 (1992), vol. 718 of Lect. Notes in Computer Science, Berlin, Heidelberg, New York: Springer, pp. 539-542
25. Lidl, R., Müller, W. B., Oswald, A.: Some remarks on strong Fibonatci pseudoprimes. AAECC 1, 59-65 (1990)
26. Lieuwens, E.: Do there exist composite numbers M for which kφ(M) = M - 1 holds? Nieuw Archief voor Wiskunde (3) XVIII, 165-169 (1970)
27. Loh, G.: Carmichael numbers with a large number of prime factors. AMS Abstracts 9, 329. Abstract 88T-11-151 (1988)
28. Löh, G., Niebuhr, W.: Carmichael numbers with a large number of prime factors, II. AMS Abstracts 10, 305 (1989), Abstract 89T-11-131
29. Nicolas, J.-L.: On highly composite numbers. In: Ramanujan revisited (1988). Andrews, G., Askey, R., Berndt, B., Ramanathan, K., Rankin, R. (eds.) New York, London: Academic Press, pp. 215-244
30. 15. Math. Comp. 61(203), 381-392 (July 1993)
31. 13. Preprint, 1995
32. 9. Math. Comp. 35(151), 1003-1026(1980)
33. Porto, A. D., Filipponi, P.: A probabilistic primality test based on the properties of certain generalized Lucas numbers. In: Advances in Cryptology - EUROCRYPT'88 (1988), Günther, C. G. (ed.), vol. 330 of Lect. Notes in Computer Science. Berlin, Heidelberg, New York, Springer, pp. 211-223
34. Ramanujan, S.: Highly composite numbers. Proc. London Math. Soc. 2(14), 347-409 (1915)
35. Ribenboim, P.: The book of prime number records, 2nd ed. Berlin, Heidelberg, New York, Springer 1989
36. Riessei, H.: Prime numbers and computer methods for factorization, 2nd ed., vol. 57 of Progress in Mathematics. Basel: Birkhäuser 1985
37. Wagstaff, S. S. Jr: Large Carmichael numbers. Math. J. Okayama Univ. 22, 33-41 (1980)
38. Williams, H. C.: On number analogous to the Carmichael numbers. Canadian Math. Bull. 20(1), 133-143 (1977)
39. Woods, D., Huenemann, J.: Larger Carmichael numbers. Comp. Math. Appls. 8(3), 215-216 (1982)
40. Yorinaga, M.: Numerical computation of Carmichael numbers. Math. Okayama University 20(2), 151-163 (1978)
41. Yorinaga, M.: Carmichael numbers with many prime factors. J. Okayama Univ. 22, 169-184 (1980)
42. Zhang, M.: Searching for large Carmichael numbers. Sichuan Daxue Xuebao, Dec. 1991. (to appear)