Large Sophie Germain primes-Reference-Cited by-同舟云学术

Large Sophie Germain primes

Published:1996 Issue:213 Volume:65 Page:393-396
ISSN:0025-5718
Container-title:Mathematics of Computation
language:en
Short-container-title:Math. Comp.

Author:

Dubner Harvey

Abstract

If P P is a prime and 2 P + 1 2P+1 is also prime, then P 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.

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,Computational Mathematics,Algebra and Number Theory

Link

http://www.ams.org/mcom/1996-65-213/S0025-5718-96-00670-9/S0025-5718-96-00670-9.pdf

Reference6 articles.

1. New primality criteria and factorizations of 2^{𝑚}±1;Brillhart, John;Math. Comp.,1975

2. [2] C. Caldwell, Review of the Cruncher PC plug-in board, J. Recreational Math. 25 (1993), 56–57.

3. [3] \bysame, The largest known primes, updated regularly and is available on request. Tel. (901) 587–7360, E-mail: caldwell@UTmartn.bitnet

4. The Book of Prime Number Records

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Characterizing Safe Primes Via Primitive Roots;Mathematics Magazine;2024-08-29

2. Sequences in finite fields yielding divisors of Mersenne, Fermat and Lehmer numbers, II;Notes on Number Theory and Discrete Mathematics;2024-05-08

3. A Note on Generalized Sophie Germain Primes;Resonance;2023-06-21

4. Notes on the Equation d(n) = d(φ(n)) and Related Inequalities;Mathematica Slovaca;2023-06-01

5. A Heuristic Framework to Search for Approximate Mutually Unbiased Bases;Cyber Security, Cryptology, and Machine Learning;2022