20070115, 12:13  #1 
Jun 2003
1010100111110_{2} Posts 
Left over Sophie Germain primes?
Now that the twin prime has been found, can some one just run thru all the 1 primes found and test if k*2^(n+1)1 is also prime? Eventhough it is a long shot, who knows, there just might be a Sophie Germain prime lurking there!

20070115, 12:30  #2  
"Robert Gerbicz"
Oct 2005
Hungary
2^{4}·101 Posts 
Quote:
Járai has used a combined sieve, I think for k*2^n+1 and k*2^(n+1)1, that's the reason why their k value's are so large (15 digits), and they've found record twin and Sophie Germain primes for n=171960. Last fiddled with by R. Gerbicz on 20070115 at 12:30 

20070115, 12:42  #3 
Jun 2003
2·2,719 Posts 
I am not suggesting that the present search continue to look for SG, but merely to take the currently found primes (IIRC, < 1000) and just see if they yield any SG primes. An opportunistic longshot rather than a determined effort.
Last fiddled with by axn on 20070115 at 12:44 Reason: spelling 
20070115, 12:57  #4  
"Robert Gerbicz"
Oct 2005
Hungary
2^{4}×101 Posts 
Quote:
You can double your chance: if k*2^n1 is prime then check k*2^(n+1)1 but also check k*2^(n1)1. And you can also sieve up to say 10^7 or something like that, because by large probability these numbers has got a small prime factor. Then do PRP test for the survivors. 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Sophie Germain Twins  Trejack  Twin Prime Search  10  20160623 15:10 
SophieGermain primes as Mersenne exponents  ProximaCentauri  Miscellaneous Math  15  20141225 14:26 
SophieGermain sieve  firejuggler  Software  4  20140110 00:09 
Less than 10,000 left....  petrw1  PrimeNet  311  20100406 05:18 
Sophie Germains, multiple nranges, future of TPS  MooooMoo  Twin Prime Search  8  20081105 15:03 