![]() |
|
|
#133 |
|
"Lennart"
Jun 2007
25·5·7 Posts |
|
|
|
|
|
|
#134 |
|
May 2008
Wilmington, DE
54448 Posts |
I'm adding 10 cores to the effort. Let's put a dent in this sub-project.
![]() 1ker's are getting somewhat boring Make that 19 cores - I'm REALLY bored Last fiddled with by MyDogBuster on 2011-05-13 at 20:12 |
|
|
|
|
|
#135 |
|
May 2004
FRANCE
22×5×29 Posts |
60357*2^1676907+1 is prime !
Congrats to mdettweiler and RaidersOfTheLostPrimes team for this nice success!! Regards, Jean |
|
|
|
|
|
#136 |
|
A Sunny Moo
Aug 2007
USA (GMT-5)
141518 Posts |
It's about time:
60357*2^1676907+1 is prime! ![]() We've been long overdue (so to speak) for a prime on this port, so it's very nice to finally see one of these stubborn k's fall. Also of personal significance, this is my first megabit prime, and consequently my largest prime to date. ![]() P.S. @Jean: It is our usual procedure to wait until the finder of a prime has reported it himself before specifically mentioning it on the forum. The reasoning for this is that it could be "stolen" by an unscrupulous person browsing the forum who decides to report it to the top-5000 under his own name. Also, many people could be rather annoyed by someone "stealing their thunder" and announcing their prime before them. I don't mind myself, but I just wanted to let you know for future reference. An acceptable way to make mention of a yet-unreported prime would be "I see Max has found a prime on this drive--congratulations!" or something along those lines. The important thing is that the prime itself not be posted in the forum until either a) the discoverer has announced it; or b) the discoverer has let it sit for a long time and Gary announces it. (We haven't had to deal with the latter yet at CRUS, though over at NPLB there have been a number of occasions where a discoverer reported a prime to the top-5000 but didn't announce it in the forum.) Anyway, just wanted to give you a heads-up on that. Gary had deleted your post earlier, for this reason; now that I've announced the prime, I've undeleted your post.
|
|
|
|
|
|
#137 |
|
"Mark"
Apr 2003
Between here and the
24×397 Posts |
Congrats Max!
BTW, for those who hadn't noticed, PrimeGrid has found 4 new primes for the Riesel Problem (formerly known as RieselSieve) in the past month. All are in the Top 50 (of the Top 5000). That is amazing. Maybe CRUS base 2 conjectures could find similar luck. |
|
|
|
|
|
#138 | |
|
May 2007
Kansas; USA
28A316 Posts |
Quote:
![]() ![]() ![]() ![]() Congrats Max on a huge prime; now our 2nd largest of all time! That's 3 huge primes in ~3 days for CRUS. The proofs of R49 and S626 being the other two. Collectively they make our 1st, 2nd, & 4th largest primes of all time. It also moves CRUS ahead of the 321 search project into 9th place on total project score. ![]() This is strangely similar to our haul in Oct. 2009 over ~12 days when proofs of S23 and S18 combined with a prime for R6 made our 3 largest primes ever at that time. |
|
|
|
|
|
|
#139 | ||
|
May 2008
Wilmington, DE
22×23×31 Posts |
Quote:
![]() Quote:
|
||
|
|
|
|
|
#140 | |
|
May 2007
Kansas; USA
242438 Posts |
Quote:
Your proof of R566 ~34 days ago is now our 5th largest of all time. So that's 4 out of the top 5 (1st, 2nd, 4th, & 5th) found over 34 days. Alas, Oct. 2009 has the 4-prime run beat by a little. Back then, we had yet another R6 prime 5 days before the other 3 primes making it 4 huge primes over ~17 days...and further, it was our 4 largest at the time! The 4 largest for the project in ~17 days is a record that will be very difficult to beat now or in the future. But we certainly can get 4 out of the top 5 in < 17 days by finding a prime here in the next 13 days. That would be another record! :-) Last fiddled with by gd_barnes on 2011-06-01 at 19:48 |
|
|
|
|
|
|
#141 |
|
Mar 2006
Germany
290710 Posts |
So where is the next one? I can see it around the corner!
|
|
|
|
|
|
#142 | |
|
May 2008
Wilmington, DE
1011001001002 Posts |
Quote:
20049*2^1687252-1 is prime Just submitted it to the good professor. Another one over 500K digits (507918). We are on a serious roll here. Last fiddled with by MyDogBuster on 2011-06-02 at 13:23 |
|
|
|
|
|
|
#143 |
|
Mar 2006
Germany
32×17×19 Posts |
Congrats to both finders!
I've also updated my page for the Liskovets-Gallot Conjectures (minor things not yet there) with the 2 new primes found. So for now: 16 primes to find to prove those 4 Conj: - Even Sierpinski k*2^n+1 composite for all even n: 2 to go - Odd Sierpinski k*2^n+1 composite for all odd n: 5 to go - Even Riesel k*2^n-1 composite for all even n: 3 to go - Odd Riesel k*2^n-1 composite for all odd n: 6 to go |
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Sierp base 6 - team drive #3 | gd_barnes | Conjectures 'R Us | 373 | 2014-06-11 21:31 |
| Sierp base 16 - team drive #1 | gd_barnes | Conjectures 'R Us | 254 | 2014-06-10 16:00 |
| PRPnet 2nd drive-51 bases with <= 5 k's to n=250K | gd_barnes | Conjectures 'R Us | 158 | 2013-08-12 03:18 |
| New PRPnet drive discussion | mdettweiler | Conjectures 'R Us | 89 | 2011-08-10 09:01 |
| Sierp base 3 - mini-drive II | gd_barnes | Conjectures 'R Us | 46 | 2009-10-26 18:19 |