![]() |
some more..
[CODE]173056*19^25816+1 101914*19^25819+1 39376*19^25828+1 275164*19^25831+1 246360*19^25879+1 44586*19^25908+1 194194*19^25913+1 648754*19^25943+1 678856*19^25950+1 496996*19^26000+1 661464*19^26049+1 26734*19^26119+1 682434*19^26195+1 61884*19^26201+1 192144*19^26311+1 205996*19^26312+1 539284*19^26387+1 3946*19^26452+1 350286*19^26504+1 332634*19^26515+1 58104*19^26561+1 505044*19^26597+1 441324*19^26737+1 40816*19^26764+1 256576*19^26790+1 56554*19^26815+1 229494*19^26833+1 493264*19^26833+1 733534*19^26867+1 293866*19^26872+1 441426*19^27028+1 549106*19^27070+1 504216*19^27080+1 453406*19^27172+1 66406*19^27216+1 145314*19^27229+1 255876*19^27238+1 626106*19^27280+1 137406*19^27332+1 479406*19^27526+1 368664*19^27559+1 510504*19^27559+1 736116*19^27602+1 685926*19^27866+1 541344*19^27933+1 29884*19^27971+1 686916*19^28018+1 481956*19^28132+1 661224*19^28247+1 160974*19^28309+1 403686*19^28310+1 653574*19^28367+1 551754*19^28449+1 412014*19^28477+1 466264*19^28561+1 527182*19^28614+1 138304*19^28759+1 278626*19^28788+1 465006*19^28832+1 547644*19^29147+1 57006*19^29158+1 46384*19^29251+1 270444*19^29411+1 364144*19^29421+1 439906*19^29434+1 689704*19^29483+1 703666*19^29664+1 634506*19^29698+1 711484*19^29825+1 627976*19^29908+1 [/CODE] |
sierp-b17: one k remaining, n = 450K
sierp-b19: 1042 k remaining, n ~ 30k continueing. |
Sierp base 22 is now complete to n=250K in the PRPnet mini drive. Nothing to report. Where are the primes on bases 22 and 26? :-(
|
Just to get the ball rolling on the lowest untested base...
I'll take Sierpinski base 7, k<=1M to...I don't know, maybe n=10k? We'll see. :smile: |
[QUOTE=Mini-Geek;198316]Just to get the ball rolling on the lowest untested base...
I'll take Sierpinski base 7, k<=1M to...I don't know, maybe n=10k? We'll see. :smile:[/QUOTE] Why don't you follow the old milestone, which is pretty easily done for lower bases, and test each new k-range to n=25K or higher, it will take up less of Garys time and make your effort more valueable. Regards KEP |
[quote=KEP;198325]Why don't you follow the old milestone, which is pretty easily done for lower bases, and test each new k-range to n=25K or higher, it will take up less of Garys time and make your effort more valueable.
Regards KEP[/quote] Ok, I'll take it to 25K. This base sure seems to go a lot faster than those small-conjecture large-base ones I've been running lately. I'm currently PFGWing the 85 remaining k's for n=2500-10K sieved at a roughly optimal depth for that. Then I'll remove k's with primes, sieve for 10K-25K, and PFGW 10K-25K. |
Riesel Base 25
Riesel Base 25 k>50K complete n=25K-50K
37 primes found (see attached file) Results emailed Releasing Base |
[QUOTE=Mini-Geek;198328]Ok, I'll take it to 25K. This base sure seems to go a lot faster than those small-conjecture large-base ones I've been running lately. I'm currently PFGWing the 85 remaining k's for n=2500-10K sieved at a roughly optimal depth for that. Then I'll remove k's with primes, sieve for 10K-25K, and PFGW 10K-25K.[/QUOTE]
It's always a very big difference between the small ones and the big ones. I.e. Taking Sierp base 63 to n=25000, takes 1-2 years. On the same time, one can do about 10,000,000,000 k's to n=25K for a base 3 range. Sometimes it is hard to know what one feels about big bases, because it can struck one with surprise how much it actually slows down to do a test at i.e. b=1023. But if the conjecture is small and the base isn't very low on primes or the base doesn't take to long to do a single test, then n=25K is a very important first milestone. And to be honest, for small conjectures, it really isn't that hard to get to n=25K, especially if one follows your approach by doing a little bit of sieving, then brute testing and finish with further sieving and brute testing :smile: But in the future, as long as Gary doesn't complain, I guess things is alright :smile: Regards KEP |
Riesel Base 27
Riesel Base 27 tested to n=450K
Nothing found - continuing |
Sierp base 7 k<=1M complete to n=25K. 7 k's remaining.[CODE]242334
525244 550366 697464 728212 753472 987144[/CODE]All primes and MOB removals e-mailed to Gary. All PRPs verified. |
1 Attachment(s)
Riesel base 23 is complete to n=500K, no primes. Results for 400K-500K are attached. Continuing. :ouch2:
|
| All times are UTC. The time now is 23:08. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.