mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Math

Reply
 
Thread Tools
Old 2005-05-03, 03:04   #12
wblipp
 
wblipp's Avatar
 
"William"
May 2003
New Haven

2·7·132 Posts
Default

Quote:
Originally Posted by thommy
When i get a prime every 500 candidates i test, i think i ll possible have to find 500 primes (so checking 500*500=250000) candidates to find a twin prime.
That estimate implicitly assumes that primality x and x+2 are independent events, but they aren't. For example, x not divisible by 3 makes the probability x+2 is not divisible by 3 only 1/2 instead of 2/3. The sum of all of these is effects is known as the twin prime constant, and it's value is about 0.66. In consequence, you should expect to check 500 * 500 * (1/0.66) candidates, about 50% more than your estimate.

You may also need some luck from Poisson. While the average number of twin prime pairs should be 1, that includes combinations of zero, one, two, three and more twin primes. The probability of "n" twins should be Poisson distributed, which means that if the expected number is "n", the probability of zero twins is exp(-n). This is a disappointingly large 37% at the point the expected number is 1.

Good luck with the search.
wblipp is offline   Reply With Quote
Old 2005-06-11, 16:50   #13
jasong
 
jasong's Avatar
 
"Jason Goatcher"
Mar 2005

3·7·167 Posts
Default

Is the original poster of this thread still around? Trying to set a new twin prime record with a distributed attack sounds like a fun project.
jasong is offline   Reply With Quote
Old 2005-06-11, 18:33   #14
Joshua2
 
Joshua2's Avatar
 
Sep 2004

53310 Posts
Default

Yes, I am, still going at it sieving. Sieved up to 214 trillion. Still getting them one every 3 seconds. On a 3.4 ghz P4 it takes 60 seconds to do an llr. On an 2600+ AthlonXP it takes about 120 seconds. On an old P3 600 mhz it takes about 620 seconds to do one. So it seems I will be sieving for a long time. However, there are just over 12 million candidates left, and I will never be able to test that many, unless we can get a distributed team going. If we are only going to test say half of them, then I will only need to sieve half as high.
With 12 million left at 3 seconds (AthlonXP and P4 seem to be around the same speed) each, it will take at least 10,000 hours (A little over one 2600+ AthlonXP or 3.4 Ghz P4 year). It will approach 200,000 hours (or almost 23 3.4 ghz P4 years) if we had to llr them all. (assuming my calculations are correct)

Last fiddled with by Joshua2 on 2005-06-11 at 18:48
Joshua2 is offline   Reply With Quote
Old 2005-06-11, 18:44   #15
smh
 
smh's Avatar
 
"Sander"
Oct 2002
52.345322,5.52471

4A516 Posts
Default

Quote:
On a 3.4 ghz P4 it takes 60 seconds to do an llr.
It's been a long time since i did prp tests, but 60 seconds a test......
smh is offline   Reply With Quote
Old 2005-06-11, 18:46   #16
Joshua2
 
Joshua2's Avatar
 
Sep 2004

13×41 Posts
Default

I've made a couple edits to my post just above, bad caluclations it seemed. I think they are right now though. I also added in more times.
SMH, 60 seconds? long, short, normal?? I'm guessing long...

Last fiddled with by Joshua2 on 2005-06-11 at 18:54
Joshua2 is offline   Reply With Quote
Reply



Similar Threads
Thread Thread Starter Forum Replies Last Post
332.2M - 333.9M (aka 100M digit range) Uncwilly LMH > 100M 684 2018-07-01 10:52
Mersenne Primes p which are in a set of twin primes is finite? carpetpool Miscellaneous Math 3 2017-08-10 13:47
What to do with 16 digit twin, non-Mersenne primes? RienS Miscellaneous Math 15 2014-11-18 01:48
GPU72 / MISFIT use for 100M digit range? Uncwilly GPU to 72 64 2013-03-31 02:45
twin primes! sghodeif Miscellaneous Math 9 2006-07-19 03:22

All times are UTC. The time now is 15:02.


Mon Aug 2 15:02:34 UTC 2021 up 10 days, 9:31, 0 users, load averages: 3.25, 3.17, 3.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.