A new method for producing large Carmichael numbers

Author:
H. Dubner

Journal:
Math. Comp. **53** (1989), 411-414

MSC:
Primary 11A51; Secondary 11Y11

MathSciNet review:
969484

Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: A new method for producing large three-component Carmichael numbers is derived. Only two primes must be found simultaneously instead of three as in the "standard" method. For each set of two primes many third primes can be found. Several Carmichael numbers with more than 3000 digits are shown, with the largest having 3710 digits.

**[1]**John Brillhart, D. H. Lehmer, and J. L. Selfridge,*New primality criteria and factorizations of 2^{𝑚}±1*, Math. Comp.**29**(1975), 620–647. MR**0384673**, 10.1090/S0025-5718-1975-0384673-1**[2]**Jack Chernick,*On Fermat’s simple theorem*, Bull. Amer. Math. Soc.**45**(1939), no. 4, 269–274. MR**1563964**, 10.1090/S0002-9904-1939-06953-X**[3]**H. Dubner, Letter to S. S. Wagstaff, Jr., dated August 13, 1985.**[4]**H. Dubner & R. Dubner, "The development of a powerful low-cost computer for number theory applications,"*J. Recreational Math.*, v. 18, no. 2, 1985-1986, pp. 81-86.**[5]**Donald E. Knuth,*The art of computer programming. Vol. 2*, 2nd ed., Addison-Wesley Publishing Co., Reading, Mass., 1981. Seminumerical algorithms; Addison-Wesley Series in Computer Science and Information Processing. MR**633878****[6]**Samuel S. Wagstaff Jr.,*Large Carmichael numbers*, Math. J. Okayama Univ.**22**(1980), no. 1, 33–41. MR**573668****[7]**Dale Woods and Joel Huenemann,*Larger Carmichael numbers*, Comput. Math. Appl.**8**(1982), no. 3, 215–216. MR**662584**, 10.1016/0898-1221(82)90044-X

Retrieve articles in *Mathematics of Computation*
with MSC:
11A51,
11Y11

Retrieve articles in all journals with MSC: 11A51, 11Y11

Additional Information

DOI:
https://doi.org/10.1090/S0025-5718-1989-0969484-8

Article copyright:
© Copyright 1989
American Mathematical Society