mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Twin Prime Search

Reply
 
Thread Tools
Old 2009-04-14, 11:45   #1
cipher
 
cipher's Avatar
 
Feb 2007

211 Posts
Default What if we don't find twin prime n=333333?

What is the probability that we will find twin prime for n=333333 before 100G is up?

What if we don't find a twin prime before 100G? do we start sieving 100G to 200G? or do we abandon n=333333 for a higher n=Value?

Thanks
cipher is offline   Reply With Quote
Old 2009-04-14, 14:20   #2
Svenie25
 
Svenie25's Avatar
 
Aug 2008
Good old Germany

8D16 Posts
Default

Over at primegrid Lennart said, that they will stop LLR until the sieve is at 12P. I´ve seen for myself, that sieving needs atm ~45 seconds for one k and a LLRtest takes 2:40 minutes.
I think that nobody expected, that we will need so long to find this little twin. One of the problems ist, that primes you find here (no twin) will not get into the top5000. And so not many people are interested. But on the other hand, in the last few days were more than 2 times more LLRtest were crunched at Primegrid.
And for myself I would like to see the end of this project. There must be a twin! ;)
Hopefully it is not to far in the future...
Svenie25 is offline   Reply With Quote
Old 2009-04-15, 15:28   #3
MooooMoo
Apprentice Crank
 
MooooMoo's Avatar
 
Mar 2006

2·227 Posts
Default

Quote:
Originally Posted by cipher View Post
What is the probability that we will find twin prime for n=333333 before 100G is up?

What if we don't find a twin prime before 100G? do we start sieving 100G to 200G? or do we abandon n=333333 for a higher n=Value?

Thanks
The probability that we'll find a twin between now (60G) and 100G is about 60-65%.

There are no plans for sieving 100G-200G, so it looks like we'll abandon n=333333 for a higher n-value.
MooooMoo is offline   Reply With Quote
Old 2009-04-15, 15:35   #4
Svenie25
 
Svenie25's Avatar
 
Aug 2008
Good old Germany

3×47 Posts
Default

Oh, doesn´t sound good. But we will see. I´m switching now back to sieving until at least sunday. should be the next n? n=666666?

Last fiddled with by Svenie25 on 2009-04-15 at 15:43
Svenie25 is offline   Reply With Quote
Old 2009-04-16, 02:48   #5
geoff
 
geoff's Avatar
 
Mar 2003
New Zealand

13×89 Posts
Default

It should be possible to make a program that sieves x different (carefully chosen) exponents at once at only a small extra cost in time (but requiring x times more memory).

Minimising the number of 1 bits in the binary expansion of the exponent should also reduce sieve time (i.e. an exponent which is a power of two would be fastest).

E.g. sieving n=2^19+1=524289 and n=2^19+2^18+1=786433 together should be almost as fast as sieving n=524289 alone.
geoff is offline   Reply With Quote
Old 2009-04-16, 21:53   #6
Joshua2
 
Joshua2's Avatar
 
Sep 2004

13×41 Posts
Default

A 64 bit sieve would be good too. But it would be good to have a n that finds top-5000 primes again.
Joshua2 is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Highest Prime is also a twin prime... NOT hydeer Lone Mersenne Hunters 9 2018-04-03 22:54
Twin Prime Days, Prime Day Clusters cuBerBruce Puzzles 3 2014-12-01 18:15
n=333333 Twin Found! Kosmaj Twin Prime Search 12 2009-08-14 13:10
After we find a twin, our next exponent will be... MooooMoo Twin Prime Search 49 2006-12-31 21:52
If you find a twin prime... MooooMoo Twin Prime Search 2 2006-05-11 23:38

All times are UTC. The time now is 18:07.


Wed Dec 1 18:07:15 UTC 2021 up 131 days, 12:36, 3 users, load averages: 1.58, 1.37, 1.34

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.