![]() |
R520 tested to n=100k (50-100k)
1 prime found, 5 remain 330*520^58090-1 is prime! Results emailed - Base released |
Reserving R518 to n=100k (50-100k) for BOINC
|
Reserving S553 to n=100k (50-100k) for BOINC
|
Reserving S529 to n=100k (50-100k) for BOINC
Reserving R558 to n=100k (50-100k) for BOINC Reserving S572 to n=100k (50-100k) for BOINC |
R518 tested to n=100k (50-100k)
1 prime found, 6 remain 136*518^59529-1 is prime! Results emailed - Base released |
S553 tested to n=100k (50-100k)
2 primes found, 4 remain 1852*553^52517+1 is prime! 372*553^73872+1 is prime! Results emailed - Base released |
R920 tested to n=500k (100-500k)
2 primes found, 3 remain 82*920^262409-1 is prime! 29*920^367810-1 is prime! Results emailed - Base released |
R972 tested to n=100k (25-100k)
5 primes found, 10 k's remained 78*972^27907-1 is prime! (83379 decimal digits) 6*972^36702-1 is prime! (109655 decimal digits) 260*972^41245-1 is prime! (123229 decimal digits) 111*972^59402-1 is prime! (177476 decimal digits) 188*972^80392-1 is prime! (240187 decimal digits) Results emailed - Base released |
Reserving R927 to n=100k (25-100k) for BOINC
|
Is there any need for doublecheck files?
TL;DR: Because the progress of my reservation of 242*967^n-1, n>200k, was terrible slow (longer than an hour per each n, and this after I sieved deeeeepppp deeeeep deep deep, until a factor was found every ~3500 seconds) I started a "DC", based on the idea that maybe a prime was missed, which would save me a lot of work. I went through all n's from zero to hero, first faster, then slower, and I stopped at 120k when the things were getting sensible slow and I considered that I better llr the reserved range (200k++) of n's. Currently at n~=250k. Still going slow. I have the DC files for n<120k, if they are of any use, I would sent them. |
S572 tested to n=100k (50-100k)
nothing found Results emailed - Base released |
| All times are UTC. The time now is 23:17. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.