Large Sophie Germain primes
HTML articles powered by AMS MathViewer
- by Harvey Dubner PDF
- Math. Comp. 65 (1996), 393-396 Request permission
Abstract:
If $P$ is a prime and $2P+1$ is also prime, then $P$ is a Sophie Germain prime. In this article several new Sophie Germain primes are reported, which are the largest known at this time. The search method and the expected search times are discussed.References
- John Brillhart, D. H. Lehmer, and J. L. Selfridge, New primality criteria and factorizations of $2^{m}\pm 1$, Math. Comp. 29 (1975), 620–647. MR 384673, DOI 10.1090/S0025-5718-1975-0384673-1
- C. Caldwell, Review of the Cruncher PC plug-in board, J. Recreational Math. 25 (1993), 56–57.
- —, The largest known primes, updated regularly and is available on request. Tel. (901) 587–7360, E-mail: caldwell@UTmartn.bitnet
- G. H. Hardy and E. M. Wright, An introduction to the theory of numbers, 5th ed., The Clarendon Press, Oxford University Press, New York, 1979. MR 568909
- Paulo Ribenboim, The book of prime number records, 2nd ed., Springer-Verlag, New York, 1989. MR 1016815, DOI 10.1007/978-1-4684-0507-1
- H. Riesel, Prime numbers and computer methods for factorization, Birkhäuser, Boston, 1958.
Additional Information
- Harvey Dubner
- Affiliation: 449 Beverly Road, Ridgewood, New Jersey 07450
- Email: 70372.1170@compuserve.com
- Received by editor(s): March 7, 1994
- Received by editor(s) in revised form: April 26, 1994
- © Copyright 1996 American Mathematical Society
- Journal: Math. Comp. 65 (1996), 393-396
- MSC (1991): Primary 11A41
- DOI: https://doi.org/10.1090/S0025-5718-96-00670-9
- MathSciNet review: 1320893