20060622, 09:42  #89  
Oct 2005
Italy
3×113 Posts 
Quote:
Please join us !!! 

20060622, 23:40  #90  
Apprentice Crank
Mar 2006
706_{8} Posts 
Quote:
I have no objection to distributed sieving. If you're interested in participating, post in the "sieving discussion thread". The problem will be getting a factor verification system that will automatically make changes to the list of k's to test. Last fiddled with by MooooMoo on 20060622 at 23:41 

20060623, 11:05  #91 
Jun 2005
Near Beetlegeuse
2^{2}·97 Posts 
I trust an interested nonparticipant can make a point.
It is not a question of whether k should be odd or even. Let a, b, be twin prime of the form 6q + r where r = (1, 5) (a < b) Then a == 5(mod 6) and b == 1(mod 6) and a = 6q + 5, b = 6(q + 1) + 1 so that a + b = 12q + 12 and a + 1 = 6q + 6 Therefore, a + 1 == 0(mod 6) Now, when searching for numbers d of the form k(2^n) where it is hoped that d + 1 are twin prime, then d needs to be == 0(mod 6), and therefore k == 0(mod 3). I suggest that you will speed up your search considerably if you adopt this approach. 
20060623, 13:46  #92 
Nov 2005
2^{4}·3 Posts 
Numbers, this was the very first step taken by the sieve. In fact, unless I am reading your comment wrong, "sieving" is simply generalizing this to primes > 3. For an odd prime p, there are always exactly two congruence classes which can be eliminated.

20060623, 15:35  #93  
Jun 2005
Near Beetlegeuse
2^{2}·97 Posts 
John,
Well I will be the first to admit that I may have misunderstood what you were doing. From this post... Quote:
Then, from this post... Quote:
That is what you are doing, right? Well, from this post... Quote:
and this post... Quote:
The point of my post was that you can eliminate two thirds of your candidates before you start sieving by simply making sure that k is divisible by 3. If k is not divisible by 3 then k(2^n)+ 1 will not be twin prime. If you, or your team, were not aware of this then why were they discussing whether k should be odd or even? It doesn't matter whether it is odd or even, what matters is that k MUST be divisible by 3. 

20060623, 17:05  #94  
Nov 2004
California
2^{3}×3×71 Posts 
Quote:
The sieving step takes care of the divisible by 3 problem pretty quickly and efficiently. None of the available ranges have an k's that are not divisible by 3. 

20060623, 18:02  #95  
Apprentice Crank
Mar 2006
2×227 Posts 
Quote:
2.) We'll put those numbers in PRP, which will search for primes of k*2^n+1 only However, that post was from 2 months ago. At that time, I wasn't sure on whether to check +1 or 1 first. Later, I decided on 1 because it was slightly faster: 168367377*2^1950001 is prime! Time : 95.454 sec. 168367377*2^195000+1 is not prime. Proth RES64: 2A409B23B3D7987E Time: 95.728 sec. 186002877*2^1950001 is prime! Time : 104.031 sec. 186002877*2^195000+1 is not prime. Proth RES64: 29FD50C0848E4FEE Time: 104.398 sec. I simply forgot to edit the post from 2+ months ago. 

20060821, 11:30  #96 
Oct 2005
Italy
3×113 Posts 
I tried to make range reservation automatic.
Please try the dynamic website here: http://www.twinprimesearch.org/TPSDIN/index.htm Try to register (you should receive an email for confirmation, but for some email acconunt there can be some problems, in such case I'll confirm your registration manually). Then try to reserve a range (it is only a test , the reservation is not valid, do the valid reservations on the forum as usual), try to set the range as "completed" with the number of primes found. When you reserve a range the site checks that the SAME range is not ALREADY reserved by somebody else, but if the range differs slightly it is quite difficult to avoid the reservation. So always check the status page. 
20061227, 07:42  #97 
Dec 2006
Anchorage, Alaska
116_{8} Posts 
So at what point does this search start 'making the books'? Oviously when a Twin Prime is found, but what other milestones (if any) do we have to look foward to?

20061227, 19:27  #98 
Apprentice Crank
Mar 2006
2×227 Posts 
For psychological, feel good milestones, you could use the number of primes found as milestones. For every 100 primes found, there'll be something to be happy about.
Other than that, finishing 25G and finding a twin prime are about the only concrete milestones. Finishing 25G means we'll move to a new n, while finding a twin gets us a world record. As for "getting in the books", the only way to do so is when we get that twin. Even if we find a million nontwin primes, no list of records will recognize the project for that achievement. This situation will likely change once we move to the next n, since finding nontwin primes for that n will still get those primes into the list of the top 5,000 primes. 
20061228, 05:42  #99 
Dec 2006
Anchorage, Alaska
2×3×13 Posts 
Okay, thats what I figured. Thanks for the reply, I hope we find that twin prime soon!

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
A Twin Prime Search Method  jzakiya  Miscellaneous Math  12  20181211 21:09 
Highest Prime is also a twin prime... NOT  hydeer  Lone Mersenne Hunters  9  20180403 22:54 
Twin Prime Days, Prime Day Clusters  cuBerBruce  Puzzles  3  20141201 18:15 
Top10 twin prime found!  gd_barnes  Riesel Prime Search  6  20071012 18:42 
Questions about twin prime search  jasong  Twin Prime Search  14  20061214 23:16 