Reserving Riesel 904 as new to n=25K

Riesel bases 902 and 965
Primes found:
2*902^41 3*902^31 4*902^11 5*902^41 6*902^21 7*902^30051 2*965^1361 4*965^87551 6*965^101 With a conjectured k of 8, both of these are proven. 
Reserving Riesel 636 & 994 as new to n=25K

Riesel Base 636
Riesel Base 636
Conjectured k = 27 Covering Set = 7, 13 Trivial Factors k == 1 mod 5(5) and k == 1 mod 127(127) Found Primes: 18k's  File attached Remaining k's: 1k  Tested to n=25K 9*636^n1 k=25 proven composite by partial algebraic factors Trivial Factor Eliminations: 5's Base Released 
Riesel Base 994
Riesel Base 994
Conjectured k = 399 Covering Set = 5, 199 Trivial Factors k == 1 mod 3(3) and k == 1 mod 331(331) Found Primes: 252k's  File attached Remaining k's: 9k's  File attached  Tested to n=25K k=9, 144, 324 proven composite by partial algebraic factors Trivial Factor Eliminations: 133k's Base Released 
Riesel base 632
Primes found:
2*632^61 3*632^41 4*632^51 5*632^21 6*632^21 7*632^11 8*632^41 9*632^191 10*632^51 11*632^141 12*632^11 13*632^151 With a conjectured k of 14, this conjecture is proven. 
S827 and S860 k=8 conjectures proven and added to the pages.

Riesel bases 740 and 896
Primes found:
2*740^41 3*740^31 4*740^31 5*740^15941 6*740^51 7*740^11 8*740^141 9*740^11 10*740^931 11*740^21 12*740^21 13*740^11 2*896^21 3*896^11 4*896^11 5*896^221 7*896^11 8*896^2621 9*896^51 10*896^51 12*896^13861 13*896^111 The other k have trivial factors. With a conjectured k of 14, both of these are proven. 
Riesel Base 904
Riesel Base 904
Conjectured k = 1266 Covering Set = 5, 181 Trivial Factors k == 1 mod 3(3) and k == 1 mod 7(7) and k == 1 mod 43(43) Found Primes: 687k's  File attached Remaining k's: 15k's  File attached  Tested to n=25K k=9, 144, 324, 729, & 1089 proven composite by partial algebraic factors Trivial Factor Eliminations: 557 k's Base Released 
Reserving Riesel 954 and 1009 as new to n=25K

S863, S881, and S902 k=8 conjectures are proven and added to the pages.
With Mark's latest round of them on the Riesel side, this now completes all proven k=8 conjectures on both sides. I have 5 others on the Sierp side that have one k remaining at n=25K. I'll post those over the next few days. 
[QUOTE=gd_barnes;211547]S863, S881, and S902 k=8 conjectures are proven and added to the pages.
With Mark's latest round of them on the Riesel side, this now completes all proven k=8 conjectures on both sides. I have 5 others on the Sierp side that have one k remaining at n=25K. I'll post those over the next few days.[/QUOTE] Hey, I thought you said only two per day!!! That looks like three. :smile: Isn't that annoying that so many of these small conjectures have a single k remaining at n=25000? 
[quote=rogue;211556]Hey, I thought you said only two per day!!! That looks like three. :smile:
Isn't that annoying that so many of these small conjectures have a single k remaining at n=25000?[/quote] You might also remember me saying that if its 34 to complete a grouping of something, then that is fine. :smile: As for 1 k remaining, although annoying, it's definitely expected especially for bases > ~250. I'd be surprised otherwise. I don't know what others do but in this case, I searched 10 bases at once by nvalue for n=5K25K. I was fairly lucky to find a final prime on 5 of them since they were all b>300. 5 ended up with 1 k remaining. It is a pain to have to sieve them all separately but searching them all at once sure saves a lot of human time. It involves a bit of manual manipulation to get it into the proper PFGW formatted sieve file after sieving all of the bases. Srfile can't bring together multiple bases into one PFGWformatted sieve file. I personally like searching them all at once upwards by nvalue since that finds a prime the most quickly for most of them. One hint if you search several bases at once, be very careful with the stoponprime option. Since many of the k=8 conjectures had k=4 remaining, you certainly wouldn't want to stoponprime for k=4. But in this case, since they all had only 1 k remaining, I was able to have it stop when a prime was found for the BASE. Note that that wouldn't work if you had more than one k in some of the bases since you'd miss searching the remaining n's for the k('s) without a prime, but it does work well for a bunch of 1 k remaining bases. PFGW isn't sophisticated enough to be able to differentiate k=4 on one base from k=4 on a different base within the same search. Mark, can PRPnet handle searching multiple bases at once? If so, can it stop on prime for a specific k / base combo instead of just stopping when a specific k OR a specific base finds a prime? That would be very cool. Gary 
[QUOTE=gd_barnes;211557]You might also remember me saying that if its 34 to complete a grouping of something, then that is fine. :smile:[/QUOTE]
Hmm... You're giving me ideas... :innocent: [QUOTE=gd_barnes;211557]Mark, can PRPnet handle searching multiple bases at once? If so, can it stop on prime for a specific k / base combo instead of just stopping when a specific k OR a specific base finds a prime? That would be very cool.[/QUOTE] Yes, I use it for that frequently. If configured as a Sierpinski/Riesel server, the PRPNet server will stop sending out tests for a k/b/c combination when a prime is found it. Both Sierpinski and Riesel can be mixed in the same server even if the same k/b combos show up for both forms. It was how I distributed base 928 across multiple clients. There is no way to stop searching if a prime is found for a base (regardless of k and c). Is this is need? If so, I would like to understand it further. If I didn't know any better, I suspect that you would want this for a GFN type search. PRPNet supports such a search, but does not stop if a prime is found for one of the bases. 
[quote=rogue;211560]Hmm... You're giving me ideas... :innocent:
Yes, I use it for that frequently. If configured as a Sierpinski/Riesel server, the PRPNet server will stop sending out tests for a k/b/c combination when a prime is found it. Both Sierpinski and Riesel can be mixed in the same server even if the same k/b combos show up for both forms. It was how I distributed base 928 across multiple clients. There is no way to stop searching if a prime is found for a base (regardless of k and c). Is this is need? If so, I would like to understand it further. If I didn't know any better, I suspect that you would want this for a GFN type search. PRPNet supports such a search, but does not stop if a prime is found for one of the bases.[/quote] Cool! No, afaik, stopping when a prime is found for a base would not be needed in PRPnet for our needs. It just came in handy for me on a pure PFGW search on many bases with 1k remaining. It would be handy if PFGW itself could stop on a k/base combo. On the other topic, please don't "finish up" a group of something several days in a row. (lol, it wouldn't be finishing up a group of something then) If you really are finishing up a group of something, then that's fine. Weekends are very busy in my personal/business life but I have plenty of time for the projects on Monday and Tuesday; the opposite of most people. As an example, I skipped late Fri, all Sat, and most of Sun. updating the pages. I then updated them very late Sun./early Mon. There were already 1012 new bases plus 3 more that I did. I had to follow up on 2 of them and there was one that was involved with 2 different kinds of algebraic factors. Now there's the added task of running srsieve whenever there is 1 k remaining. If you guys wanna help me out a little, whenever you post a status on a new base with 1 k remaining, please run srsieve to P=511 for n=100001 to 110000 and let me know how many candidates are remaining. That will be the weight shown in the 1k thread. Gary 
Reserving Sierp 939 and Riesel 789 as new to n=25K

Riesel bases 935 and 983
Primes found:
2*935^721 4*935^11 6*935^31 8*935^21 10*935^11 12*935^21 2*983^2001 4*983^11 6*983^11 8*983^21 10*983^11 12*983^121 With a conjectured k of 14, both of these are proven. 
Sierpinski Base 1004
1 Attachment(s)
I have completed this to n=100000 and am releasing it. No primes found. The residues are attached.

Sierp Base 939
Sierp Base 939
Conjectured k = 46 Covering Set = 5, 47 Trivial Factors k == 1 mod 2(2) and k == 6 mod 7(7) and k == 66 mod 67(67) Found Primes: 18k's  File attached Remaining k's: 1k  Tested to n=25K 30*939^n+1 Trivial Factor Eliminations: 3k's k weight = 1855 Base Released 
Riesel bases 560 and 758
Primes found:
2*560^361 3*560^61 4*560^11 5*560^21 6*560^11 7*560^11 8*560^199041 9*560^11 2*758^41 3*758^11 4*758^155731 5*758^61 6*758^11 7*758^671 8*758^141 9*758^131 With a conjectured k of 10, both of these are proven. 
Riesel bases 527, 548, and 812
Primes found:
2*527^241 6*527^421 8*527^141 Conjectured k = 10. k = 4 remains. 2*548^41 3*548^141 4*548^451 5*548^81 6*548^21 8*548^21 9*548^11 10*548^11 11*548^21 12*548^141 Conjectured k = 13. k = 7 remains. 2*812^101 3*812^31 5*812^501 6*812^11 7*812^11 8*812^81 9*812^11 10*812^15751 11*812^21 12*812^11 Conjectured k = 13. k = 4 remains. All have been tested to n=25000 and have been released. As far as I can tell there are no complete algebraic factorizations for the remaining k on these conjectures. Yes, this is more than two for today, but this provides results for the remaining Riesel conjectures with k <= 13. 
New bases S650 and S797 k=8 conjectures are complete to n=25K.
Only k=4 remains on both of them. This completes all k<=8 conjectures on both sides to n=25K. 
Riesel base 863, k=14
Primes: 2*863^41 6*863^21 10*863^11 12*863^31 4*863^24031 k=8 proven composite by partial algebraic factors Base proven. 
Riesel base 577, k=18
Primes: 2*577^11 6*577^11 8*577^21 12*577^171 14*577^57751 Trivially factors: k=4,10,16 Base proven. 
[quote=gd_barnes;211787]New bases S650 and S797 k=8 conjectures are complete to n=25K.
Only k=4 remains on both of them. This completes all k=8 conjectures on both sides to n=25K.[/quote] Hmm...interesting how just k=4 remains on quite a few of these k=8 conjectures. Is there something special about k=4 that makes it extra stubborn? 
[quote=mdettweiler;211791]Hmm...interesting how just k=4 remains on quite a few of these k=8 conjectures. Is there something special about k=4 that makes it extra stubborn?[/quote]
It's 4 times a 4th power, which elimates all n's divisible by 4 on all bases and hence makes them somewhat lower weight. But other than that, no, none that I can tell. Using that logic, k's that are perfect squares on the Riesel side should be much worse since their n's cannot be divisible by 2. But my perception is that Sierp k=4 is worse than Riesel perfect squares and I don't have an explanation of why. One thing that I did recently is see how many bases <= 1024 have k=4 remaining at n=5K. There were 43 of them. Compare that to the following # of bases remaining at n=5K: Riesel k=2 25 Sierp k=2 35 Riesel k=4 30 Sierp k=4 43 Riesel k=4 was helped somewhat by having some bases k=4 eliminated due to partial algebraic factors making a full covering set but not that much difference. The Sierp side is definitely tougher for k=2 and k=4, especially on smallconjectured bases. Explantion of the elimination of n==(0 mod 4) for Sierp k=4: 4b^4 + 1 = (2b^2+2b+1) * (2b^22b+1) In all cases that I looked at for b<=1024 and k=4, this does not make a full covering set so the searches must continue. Where it does make a full covering set is on bases 55 and 81 for k=2500, which is k=4*5^4. Hence you'll see on the pages that those k's are eliminated. Gary 
[quote=rogue;211727]Primes found:
2*548^41 3*548^141 4*548^451 5*548^81 6*548^21 8*548^21 9*548^11 10*548^11 11*548^21 12*548^141 Conjectured k = 13. k = 7 remains. 2*812^101 3*812^31 5*812^501 6*812^11 7*812^11 8*812^81 9*812^11 10*812^15751 11*812^21 12*812^11 Conjectured k = 13. k = 4 remains. [/quote] Well, you ended up with only 3 new bases for the day instead of 5. (hooray!) :) Riesel bases 548 and 812 had already been done. See: [URL]http://www.mersenneforum.org/showpost.php?p=209562&postcount=306[/URL] [URL]http://www.mersenneforum.org/showpost.php?p=209597&postcount=308[/URL] I see that the untested Riesel thread may have thrown you off there because I still had those 2 as untested. I would suggest doublechecking it against the pages before starting a search. The pages should always be within ~23 days of up to date. I do my best to keep up with the untested thread but with it sorted by CK, if I forget removing something, there is not an easy way for me to double check myself. Gary 
[quote=unconnected;211788]Riesel base 863, k=14
Primes: 2*863^41 6*863^21 10*863^11 12*863^31 4*863^24031 k=8 proven composite by partial algebraic factors Base proven.[/quote] How is k=8 proven composite by partial algebraic factors? 8*863^44921 is prime! Short analysis: n==(1 mod 2); factor of 3 n==(0 mod 3); algebraic factors because a^3*b^31 has a factor of a*b1 This leaves n==(2 or 4 mod 6) that need to be searched. The best example for a small n is n=16, which has a 15digit smallest factor, i.e.: 290,080,942,920,023 * 2,610,619,153,408,518,748,349,564,802,570,449 Now the base is proven. :) Gary 
[QUOTE=gd_barnes;211847]I see that the untested Riesel thread may have thrown you off there because I still had those 2 as untested. I would suggest doublechecking it against the pages before starting a search. The pages should always be within ~23 days of up to date. I do my best to keep up with the untested thread but with it sorted by CK, if I forget removing something, there is not an easy way for me to double check myself.[/QUOTE]
Typically I do doublecheck, but I only check the last page in the forum, thinking that previous pages would have posts that you have already handled. In this case I bet that I didn't go back to previous pages to verify that nobody else had worked on them. I'll have to remember that next time. 
1 Attachment(s)
Riesel base 666, k=898
Remaining k's: 74*666^n1 139*666^n1 k=144 and k=289 proven composite by partial algebraic factors (even n  diff. of squares, odd n  factor of 29). Trivially factors  316 k's. Primes attached. 
[quote=gd_barnes;211852]How is k=8 proven composite by partial algebraic factors?
8*863^44921 is prime! Short analysis: n==(1 mod 2); factor of 3 n==(0 mod 3); algebraic factors because a^3*b^31 has a factor of a*b1 This leaves n==(2 or 4 mod 6) that need to be searched. The best example for a small n is n=16, which has a 15digit smallest factor, i.e.: 290,080,942,920,023 * 2,610,619,153,408,518,748,349,564,802,570,449 Now the base is proven. :) Gary[/quote] Oops, sorry, I've missed it. 
Riesel base 521, k=28.
Primes: 2*521^81 4*521^11 8*521^21 10*521^11 12*521^21 18*521^11 20*521^101 22*521^31 24*521^11 Trivially factors: k=6,14,16,26 Base proven. 
[quote=unconnected;212048]Riesel base 666, k=898
Remaining k's: 74*666^n1 139*666^n1 k=144 and k=289 proven composite by partial algebraic factors (even n  diff. of squares, odd n  factor of 29). Trivially factors  316 k's. Primes attached.[/quote] That's very good for such a high base! :) Just to confirm: Your search limit was n=25K. Is that correct? For the somewhat larger conjectured unproven bases such as this, it's best if a results file is provided for n>2500. 
Riesel Base 789
Riesel Base 789
Conjectured k = 236 Covering Set = 5, 79 Trivial Factors k == 1 mod 2(2) and k == 1 mod 197(197) Found Primes: 108k's  File attached Remaining k's: 5k's  Tested to n=25K 74*789^n1 116*789^n1 120*789^n1 126*789^n1 146*789^n1 k=4, 64, 144 proven composite by partial algebraic factors Trivial Factor Eliminations: 1k 198 Base Released 
[quote=gd_barnes;211589]Cool! No, afaik, stopping when a prime is found for a base would not be needed in PRPnet for our needs. It just came in handy for me on a pure PFGW search on many bases with 1k remaining. It would be handy if PFGW itself could stop on a k/base combo.[/quote]
I am not certain but i would guess that using the the serp/riesel feature would stop a k just on the base the prime was found not other bases as well. Really i would guess it is a stop on a k/base pair when a prime is found 
[quote=henryzz;212277]I am not certain but i would guess that using the the serp/riesel feature would stop a k just on the base the prime was found not other bases as well. Really i would guess it is a stop on a k/base pair when a prime is found[/quote]
Why are you guessing? Are you referring to PFGW or PRPnet? Mark already answered for PRPnet. 
[quote=gd_barnes;212337]Why are you guessing? Are you referring to PFGW or PRPnet? Mark already answered for PRPnet.[/quote]
Misread sorry 
Riesel bases 917, 911, 930, and 656
I posted none over the weekend, so I will post four today.
Primes found: 2*917^2101 4*917^31 6*917^11 8*917^161 10*917^71 12*917^11 14*917^1841 With a conjectured k of 16, this conjecture is proven. 2*911^141 4*911^11 10*911^11 12*911^21 18*911^21 The other k have trivial factors. With a conjectured k of 20, this conjecture is proven. [code] 2*930^21 3*930^11 4*930^11 5*930^11 6*930^21 7*930^21 8*930^1011 9*930^11 10*930^131 11*930^21 12*930^11 13*930^3541 14*930^21 15*930^111 16*930^11 17*930^11 18*930^41 19*930^11 [/code] With a conjectured k of 20, this conjecture is proven. [code] 2*656^101 3*656^21 4*656^111 5*656^901 7*656^11 8*656^41 9*656^11 10*656^111 12*656^121 13*656^11 14*656^21 15*656^11 17*656^1981 18*656^11 19*656^31 20*656^8781 22*656^11 23*656^181 24*656^21 25*656^31 27*656^371 28*656^11 29*656^1401 30*656^91 32*656^21 33*656^11 34*656^11 35*656^61 37*656^111 38*656^21 39*656^11 40*656^3931 42*656^11 43*656^191 44*656^41 45*656^21 47*656^541 48*656^61 49*656^11 50*656^7341 52*656^151 53*656^81 54*656^11 55*656^611 57*656^51 58*656^11 59*656^81 60*656^11 62*656^21 63*656^21 64*656^11 65*656^1241 67*656^11 68*656^21 69*656^11 70*656^371 72*656^481 73*656^51 [/code] The other k have trivial factors. With a conjectured k of 74, this conjecture is proven. 
Riesel base 683, k=20
Primes: 2*683^5401 4*683^11 6*683^21 8*683^81 10*683^11 16*683^31 18*683^361 14*683^11241 Trivially factors: k=12 Base proven. 
Reserving Riesel 611 and 628 to n=25K

S1001 is done to 40K, 2 [I]k[/I] remain. Emailed. Base released.

Riesel base 557, k=32
Primes: 2*557^81 4*557^271 6*557^21 8*557^1121 10*557^11 12*557^91 16*557^91 18*557^71 20*557^81 22*557^11 24*557^11 14*557^13641 28*557^32071 30*557^222901 1 k's remain: 26*557^n1 Base completed to 25K and released. 
Riesel base 853
Primes found:
2*853^41 6*853^2341 8*853^11 12*853^2441 14*853^11 18*853^61 20*853^21 24*853^31 26*853^61 30*853^11 32*853^21 36*853^11 38*853^11 42*853^941 44*853^191 48*853^681 50*853^11 54*853^11 56*853^61 60*853^261 The other k have trivial factors. With a conjectured k of 62, this conjecture is proven. 
Riesel Base 694
Riesel Base 694
Conjectured k = 279 Covering Set = 5, 139 Trivial Factors k == 1 mod 3(3) and k == 1 mod 7(7) and k == 1 mod 11(11) Found Primes: 141k's  File attached Remaining k's: 2k's  Tested to n=25K 96*694^n1 264*694^n1 k=9 proven composite by partial algebraic factors Trivial Factor Eliminations: 133k's Base Released 
Riesel base 743, k=32
Primes: 2*743^21 4*743^11 6*743^11 10*743^91 12*743^231 16*743^11 18*743^531 20*743^201 24*743^161 26*743^101 28*743^4371 30*743^21 Trivial factors: k=8,22. 1 k's remain: 14*743^n1 Base completed to 25K and released. 
Riesel base 887, k=38.
Primes: 2*887^401 4*887^11 6*887^21 8*887^21 12*887^21 14*887^281 16*887^271 18*887^31 20*887^81 24*887^1411 28*887^1151 30*887^31 32*887^61 34*887^2631 10*887^41071 2k's remain: 22*887^n1 26*887^n1 k=36 proven composite by partial algebraic factors. Base completed to 25K and released. 
1 Attachment(s)
serp bases 784, 785 and 788 are all tested to 50k and unreserving
results attached to fit in the forum limit i had to compress using 7zip with customised settings(ultra wasnt good enough) if you can't uncompress it i can reupload somewhere else 
Riesel 526
Reserving Riesel 526 as new to n=25K

Riesel Base 550
Reserving Riesel Base 550 as new to n=25K

[quote=henryzz;212724]serp bases 784, 785 and 788 are all tested to 50k and unreserving
results attached to fit in the forum limit i had to compress using 7zip with customised settings(ultra wasnt good enough) if you can't uncompress it i can reupload somewhere else[/quote] It doesn't appear that my laptop will download them. If I wasn't out of town, I'd look for the correct compression software and learn something about the settings but I don't have time right now. Can you Email them to gbarnes017 at gmail dot com? That's the best way for medium and largesized files. Thanks. 
1 Attachment(s)
S780 done to 100K. Base released.

1 Attachment(s)
R888 25K50K complete, no primes.
Will continue it to 100K. Also reserving R800 to 100K. 
Taking Riesel base 1025 (8*1025^n1) to n=100000

[quote=gd_barnes;212917]It doesn't appear that my laptop will download them. If I wasn't out of town, I'd look for the correct compression software and learn something about the settings but I don't have time right now.
Can you Email them to gbarnes017 at gmail dot com? That's the best way for medium and largesized files. Thanks.[/quote] Seems they're PRPnet results anywayI can open 7z files, so I'll just process them and send them to you. 
Reserving R625 to n=10K as new.

R928
Primes found:
[code] 6357*928^150401 6567*928^151151 9387*928^151421 1103*928^151931 1292*928^152441 4271*928^152471 19884*928^154331 29661*928^155301 5534*928^157471 5127*928^158781 23600*928^159011 30956*928^159331 19911*928^159541 26217*928^159951 14612*928^160751 5756*928^160821 8282*928^161061 15663*928^161281 11388*928^161481 5966*928^162111 20831*928^162061 4853*928^162451 16518*928^162561 31133*928^162901 28632*928^163711 18173*928^164091 21555*928^164251 16043*928^165021 28086*928^165651 7001*928^170751 4664*928^171271 [/code] I am ending my effort on this base. If anyone wants a file with the remaining candidates for n < 25000, let me know. 
[quote=rogue;213035]I am ending my effort on this base. If anyone wants a file with the remaining candidates for n < 25000, let me know.[/quote]
If you could post the file here or email it to Gary, he can upload it to the CRUS web pagesthat's generally where we put sieve files for unreserved ranges so that they're in a central, easily accessible place. 
Riesel base 947, k=80.
Primes: 2*947^541 6*947^31 8*947^21 10*947^31 14*947^401 18*947^61 20*947^21 22*947^891 24*947^11 26*947^21 28*947^31 30*947^11 32*947^61 36*947^51 38*947^281 40*947^11 42*947^1061 46*947^31 48*947^21 50*947^141 52*947^91 54*947^11 58*947^791 60*947^81 62*947^81 64*947^11 66*947^11 68*947^41 70*947^311 72*947^251 76*947^11 16*947^89311 4*947^100551 1k's remain: 74*947^n1 Trivially factors: k=12,34,44,56,78. Base completed to 25K and released. I'll not start the new bases in 5011024 range, just report bases which are already done. 
1 Attachment(s)
Riesel base 653, k=110.
Primes attached. 6k's remain: 4*653^n1 32*653^n1 58*653^n1 64*653^n1 82*653^n1 88*653^n1 Base completed to 25K and released. 
[quote=rogue;212945]Taking Riesel base 1025 (8*1025^n1) to n=100000[/quote]
Hey! How'd that one get in there? lmao I bet no one knew that I snuck that one on to the web pages several months ago without uttering a word about it. I know, I know, went against the project there and what I've been complaining about the last several weeks. Only us annoying admins can do that. There might even be a couple of more of them just like that on the pages, all done several months ago. Don't anyone get any wise ideas now. :smile: 
[QUOTE=gd_barnes;213196]Hey! How'd that one get in there? lmao
I bet no one knew that I snuck that one on to the web pages several months ago without uttering a word about it. I know, I know, went against the project there and what I've been complaining about the last several weeks. Only us annoying admins can do that. There might even be a couple of more of them just like that on the pages, all done several months ago. Don't anyone get any wise ideas now. :smile:[/QUOTE] Hmm, I never noticed. I'll do it anyways. 
[quote=henryzz;212724]serp bases 784, 785 and 788 are all tested to 50k and unreserving
results attached to fit in the forum limit i had to compress using 7zip with customised settings(ultra wasnt good enough) if you can't uncompress it i can reupload somewhere else[/quote] David, quick question about these: do the sieve files included correspond with the depth at which the PRP testing was done? I'm running into problems matching up the results with the sieve files and my first guess would be that there've been factors removed since. If that's the case, could you send me the original sieve files at the same depth at which you did PRP testing? Thanks. :smile: 
[quote=mdettweiler;213461]David, quick question about these: do the sieve files included correspond with the depth at which the PRP testing was done? I'm running into problems matching up the results with the sieve files and my first guess would be that there've been factors removed since. If that's the case, could you send me the original sieve files at the same depth at which you did PRP testing? Thanks. :smile:[/quote]
it's complex i first inputed undersieved files to the server and several times at unknown depths(of testing) used the remove candidates with factors from sieve file feature of prpnet i can provide the factor files i used to remove the factors i don't think i have the first set of undersieved files the reason that i started with undersieved files was that i expected to find some primes(and didn't find as many as i thought(wrongly)) which would speed up sieving lots AFAIK i have provided the most sieved files that i have with all factors removed sorry to cause confusion any idea on how to do this in future? 
[quote=henryzz;213516]it's complex
i first inputed undersieved files to the server and several times at unknown depths(of testing) used the remove candidates with factors from sieve file feature of prpnet i can provide the factor files i used to remove the factors i don't think i have the first set of undersieved files the reason that i started with undersieved files was that i expected to find some primes(and didn't find as many as i thought(wrongly)) which would speed up sieving lots AFAIK i have provided the most sieved files that i have with all factors removed sorry to cause confusion any idea on how to do this in future?[/quote] Ah, okay...no problem. Lennart did the same thing for his S25 ranges and therefore I've sent those on to Gary sorted but not checked against the original sieve file. Normally we'd prefer that factors be removed at definite nrange cutoffs so that we can match things up (to prevent server error and/or human error from causing anything to have been accidentally missed along the way) but in this case it's OK to let them slide since you guys are both pretty familiar with how this stuff works and the chance of error is rather small. As for how to do it in the future, I can't speak for Gary, but I personally would prefer removing factors at definite cutoffs so that we can make absolutely sure that nothing is missing. Having to forego checking once in a while is OK, but definitely not ideal. 
BTW, if anyone else ends up removing factors throughout like that in the future, please give me a headsup to that effect when you post your resultsit will save me a lot of time in processing to know that I don't have to even try to match up what will surely be a futile endeavor. :smile:

I cant see why it wouldn't be possible as long as you have the most sieved sieve file. What you need to do is make sure all the candidates in the sieve file have results not the other way around. I suppose your problem really is that your current script won't do that.

[quote=henryzz;213526]I cant see why it wouldn't be possible as long as you have the most sieved sieve file. What you need to do is make sure all the candidates in the sieve file have results not the other way around. I suppose your problem really is that your current script won't do that.[/quote]
Yes, you're right. I suppose I could write up a script to remove all results from a results file that aren't present in a sieve file, then check what's left with the latest sieve file. However, it does seem like a clumsy workaround to the problem, and it still doesn't solve the problem of when someone sieves throughout and removes nranges from the lower end of the sieve file as they're sieved to optimal or tested (as I believe may have happened with Lennart's S25 range, since the 3.6T sieve file he sent me was only for 52K100K, while for the lower ranges he just had a 1.2T file). I'll have to do some thinking about how to best deal with this. One possibility I've thought of is to set up a MySQL database in which to put all the results, then have scripts pull them out and verify them as needed. Even though we don't have a whole stats system set up for CRUS at this time, this would still be adequate for processing purposes. The main tricky thing is that I'd have to write a lot of scripts from scratch (since all my scripts now deal with flat text files)but I think it might be worth it in the long run due to the much greater flexibility of a database. Once it's all set up and the scripts are written, a DB would simplify processing a great deal. In the meantime, though, I'll go ahead and process your results without checking them. Any solution I come up with to this problem will probably not be available within the next few days. :smile: 
Riesel base 1025
1 Attachment(s)
I have to return a computer (my old one at work), one in which I was using for R1025. I completed it up to n=45916 with no primes found. Here are the residues.

[quote=henryzz;213516]it's complex
i first inputed undersieved files to the server and several times at unknown depths(of testing) used the remove candidates with factors from sieve file feature of prpnet i can provide the factor files i used to remove the factors i don't think i have the first set of undersieved files the reason that i started with undersieved files was that i expected to find some primes(and didn't find as many as i thought(wrongly)) which would speed up sieving lots AFAIK i have provided the most sieved files that i have with all factors removed sorry to cause confusion any idea on how to do this in future?[/quote] Hint: Don't do that! It's dangerous and cannot be subsequently verified if necessary in the future unless you keep the intial sieve file, all factors, and all results, which would be a headache worth of files to keep and match up in the future. If you're sieving n=1K to 100K, sieve the entire thing to an optimum depth for n=1K10K, break that off and test, remove k's from the remainder, sieve n=10K100K to an optimum depth for n=10K25K, break that off and test, remove k's from the remainder, and do the same for n=25K50K and then n=50K100K. (Even if using PRPnet, which will "remember" which k's have primes and so won't test them, you still need to remove them because otherwise, much additional sieving time is used.) Don't just guess at an undersieve and hope for some primes. If you don't want to spend so much time sieving such a large nrange as n=1K100K for all k's to an optimum depth for n=1K10K at first, then sieve only n=1K25K to an optimum depth for n=1K10K, break that off and test and then remove k's, sieve, and test n=10K25K. THEN do a brand new sieve for remaining k's for n=25K100K and do the final 2 steps above for n=25K50K and 50K100K. In other words, don't remove factors throughout. Pick specific breakoff points. Max, you will need to account for specific breakoff points in sieving. It's a musthave because if people aren't doing it when the high nvalue to low nvalue ratio is > ~3 to 1 (for anything n>~10K), they are wasting quite a bit of CPU resources. The key that I'm recommending to David here is that the breakoffs be minimized but specific; not at just random points throughout the process. The method in the 2nd para. above is almost exactly what I do with a small exception: I script everything to n=2500, sieve n=2.5K25K, break off n=2.5K10K, etc. and continue as shown above. I usually stop at n=25K but if I was going to n=100K, the 2nd para. above is how I would do it; that is subsequently start a brand new sieve for n=25K100K. IMHO, there are just too many k's that are eliminated at the very low nranges to justify sieving all of them for n=1K100K at once. Gary 
[quote=rogue;213035]Primes found:
[code] 6357*928^150401 6567*928^151151 9387*928^151421 1103*928^151931 1292*928^152441 4271*928^152471 19884*928^154331 29661*928^155301 5534*928^157471 5127*928^158781 23600*928^159011 30956*928^159331 19911*928^159541 26217*928^159951 14612*928^160751 5756*928^160821 8282*928^161061 15663*928^161281 11388*928^161481 5966*928^162111 20831*928^162061 4853*928^162451 16518*928^162561 31133*928^162901 28632*928^163711 18173*928^164091 21555*928^164251 16043*928^165021 28086*928^165651 7001*928^170751 4664*928^171271 [/code] I am ending my effort on this base. If anyone wants a file with the remaining candidates for n < 25000, let me know.[/quote] Please state your exact search depth. If you'd like for the sieve file to possibly be used in the future, I'll need to post it on the pages. Otherwise I virtually guarantee that it will be forgotten. Please post it here with k's removed that already have primes and with its actual sieve depth in the file. The latter is frequently needed to see if it has been sieved to an optimum depth, which can vary widely with future software and hardware improvements. Edit: k=4271 and 5534 already had primes at n=9557 and n=9921 respectively. So there are 29 primed k's for the range and 711 k's remaining at n=~17127. Gary 
Riesel Base 654
Riesel Base 654
Conjectured k = 261 Covering Set = 5, 131 Trivial Factors k == 1 mod 653(653) Found Primes: 239k's File attached Remaining k's: 14k's  Tested to n=25k 30*654^n1 44*654^n1 53*654^n1 56*654^n1 79*654^n1 100*654^n1 114*654^n1 124*654^n1 132*654^n1 136*654^n1 204*654^n1 219*654^n1 236*654^n1 239*654^n1 k=4, 9, 49, 64, 144, 169 Proven composite by partial algebraic factors Base Released 
It is with a mild sense of foreboding that announce my intention of attacking Sierpinski base 928 ([URL="http://www.mersenneforum.org/showpost.php?p=207252&postcount=214"]last attempted here[/URL])
There are 686k's remaining at n=10,000, I'm hoping to make that number a little smaller! Initial sieving has commenced, I shall post occasional updates. If people think this is foolhardy, well, that's your prerogative. If you think it's foolhardy, but wish to offer advice, please PM me :) This comes under the heading of extreme whimsy (that and wanting to stop cluttering up the forum with the 1 kremaining reservations.) 
[quote=paleseptember;213939]It is with a mild sense of foreboding that announce my intention of attacking Sierpinski base 928 ([URL="http://www.mersenneforum.org/showpost.php?p=207252&postcount=214"]last attempted here[/URL])
There are 686k's remaining at n=10,000, I'm hoping to make that number a little smaller! Initial sieving has commenced, I shall post occasional updates. If people think this is foolhardy, well, that's your prerogative. If you think it's foolhardy, but wish to offer advice, please PM me :) This comes under the heading of extreme whimsy (that and wanting to stop cluttering up the forum with the 1 kremaining reservations.)[/quote] No problem and it's not foolhardy at all as long as you are aware that it will likely take at least a full CPU year to finish. (rough estimate) The only recommendation that I'll give is to put at least a full quadcore on it unless you are very patient. The main thing to be aware of is that base 928 takes much longer to test at the same ndepth than bases in the 200s and 300s. Many people on the project like to use a personal PRPnet server for this kind and scope of effort. It allows easy management of your cores. Feel free to post questions about it. Mark (Rogue) created it. The latest version seems to work quite well. BTW, I like your 1k remaining work. That's why we have the thread. Never feel like you're cluttering up the forum with it. :smile: Gary 
[quote=gd_barnes;213957]Many people on the project like to use a personal PRPnet server for this kind and scope of effort. It allows easy management of your cores. Feel free to post questions about it. Mark (Rogue) created it. The latest version seems to work quite well.[/quote]
See [url=http://www.mersenneforum.org/showpost.php?p=209872&postcount=8]here[/url]I have a standing offer to host private LLRnet/PRPnet servers for anyone interested at NPLB or CRUS (heck, I don't mind even if you want to load in stuff from another project). This can take quite a bit of the hassle out of running a server since I've already got the infrastructure and processes set up so that adding another server over on this end is hardly a big deal. :smile: 
[QUOTE=gd_barnes;213836]Please state your exact search depth. If you'd like for the sieve file to possibly be used in the future, I'll need to post it on the pages. Otherwise I virtually guarantee that it will be forgotten. Please post it here with k's removed that already have primes and with its actual sieve depth in the file. The latter is frequently needed to see if it has been sieved to an optimum depth, which can vary widely with future software and hardware improvements.
Edit: k=4271 and 5534 already had primes at n=9557 and n=9921 respectively. So there are 29 primed k's for the range and 711 k's remaining at n=~17127. Gary[/QUOTE] Believe it or not, it was tested through n=17127. I have emailed you a zipped file of remaining k/n pairs as it is too big to attach. 
Riesel Base 1009
Riesel Base 1009
Conjectured k = 1314 Covering Set = 5, 101 Trivial Factors k == 1 mod 2(2) and mod 3(3) and k == 1 mod 7(7) Found Primes: 363k's  File attached Remaining k's: 9k's  Tested to n=25K 150*1009^n1 186*1009^n1 434*1009^n1 444*1009^n1 662*1009^n1 896*1009^n1 924*1009^n1 1112*1009^n1 1292*1009^n1 k=144, 324 proven composite by partial algebraic factors Trivial Factor Eliminations: 282k's Base Released 
Riesel Base 954
Riesel Base 954
Conjectured k = 381 Covering Set = 5, 191 Trivial Factors k == 1 mod 953(953) Found Primes: 352k's  File attached Remaining k's: 18k's  File attached  Tested to n=25K k4, 9, 49, 64, 144, 169, 289, 324 proven composite by partial algebraic factors k106 is a difference of squares Base Released 
R1019 (k=2) at n=120k, no prime, continuing.

Riesel base 623: conjectured k = 14 (covering set {3, 13}).
Primes: 2*623^21 4*623^31 6*623^41101 8*623^501 10*623^11 12*623^21 The conjecture is proven. 
Riesel Base 526
Riesel Base 526
Conjectured k = 900 Covering Set = 17, 31 Trivial Factors k == 1 mod 3(3) and k == 1 mod 5(5) and k == 1 mod 7(7) Found Primes: 406k's  File attached Remaining: 4k's  Tested to n=25K 125*526^n1 273*526^n1 630*526^n1 774*526^n1 Trivial Factor Eliminations: 488k's Base Released 
1 Attachment(s)
I've proved all of these CK=10 bases:
S527 S725 S791 S857 S890 S956 Results attached. 
Weeee. Here we go. Everyone post your gobs of new bases with CK<=200 now. :smile:
Have fun Ian. lol 
[QUOTE]Have fun Ian. lol [/QUOTE]
Not buried yet. Have 2 more HTML's to make and I'm caught up:razz: 
R703
I would like to reserve R703 as new base [tex]\therefore[/tex] to n=25K.
Edit: Yeaaaa That's a Gary one 
Reserving R986 as new to n=25K. (I've already tested it to 10K but one k stuck around, and I figured I should at least take it to 25K before giving up on it.)

R596
1 Attachment(s)
R596
With CK=200 Is complete with no primes remaining. Attached are the results Edit: Nice work Mathew. This is a very high CK to prove without much testing above n=2500 (last prime found at n=3327) 
[quote=mdettweiler;214604]Reserving R986 as new to n=25K. (I've already tested it to 10K but one k stuck around, and I figured I should at least take it to 25K before giving up on it.)[/quote]
Ian, We didn't really talk about reservations only posts for CK<=200 like this one. This is the one remaining k=8 conjecture. I'm still assuming that you will handle them, remove from untested thread, do HTML, etc. For a quick reference on the HTML, just do a find on "just started" on the pages. Gary 
[quote]We didn't really talk about reservations only posts for CK<=200 like this one. This is the one remaining k=8 conjecture.
I'm still assuming that you will handle them, remove from untested thread, do HTML, etc. For a quick reference on the HTML, just do a find on "just started" on the pages. [/quote] Seeing as my bases are so small, something like this will probably be done long before I can create a "just started" page. I'll remove it from the untested thread and make a note to myself to look out for it. 
Riesel Base 550
Riesel Base 550
Conjectured k = 666 Covering Set = 19, 29 Trivial Factors k == 1 mod 3(3) and k == 1 mod 61(61) Found Primes: 428k's  File attached Remaining: 7k's  Tested to n=25K 57*550^n1 153*550^n1 225*550^n1 227*550^n1 324*550^n1 581*550^n1 609*550^n1 k=144 proven composite by partial algebraic factors Trivial Factor Eliminations: 228k's Base Released 
Riesel bases 517, 657, and 681
Primes found:
[code] 2*657^101 4*657^1211 6*657^21 8*657^231 10*657^11 12*657^11 14*657^211 16*657^831 18*657^41 20*657^21 2*681^11 4*681^2191 8*681^71 10*681^41 12*681^11 14*681^11 20*681^11 22*681^341 24*681^21 28*681^81 30*681^2461 2*517^11 6*517^61 8*517^111 12*517^11 14*517^11 18*517^31 20*517^221 24*517^51 26*517^11 30*517^471 32*517^21 [/code] These are all proven. I have no more proven Riesel conjectures to post. 
Sierp Bases
The following Sierp Bases were submitted to me by Mark (Rogue) as proven. He sent me the found primes for all. They will be removed from the untested thread.
k*517^n+1 (conjectured k of 36) k*519^n+1 (conjectured k of 14) k*521^n+1 (conjectured k of 28) k*531^n+1 (conjectured k of 20) k*532^n+1 (conjectured k of 40) k*538^n+1 (conjectured k of 27) k*549^n+1 (conjectured k of 34) k*551^n+1 (conjectured k of 22) k*557^n+1 (conjectured k of 16) k*560^n+1 (conjectured k of 10) k*562^n+1 (conjectured k of 12) k*597^n+1 (conjectured k of 12) k*611^n+1 (conjectured k of 16) k*615^n+1 (conjectured k of 34) k*623^n+1 (conjectured k of 14) k*645^n+1 (conjectured k of 18) k*681^n+1 (conjectured k of 32) k*739^n+1 (conjectured k of 36) k*759^n+1 (conjectured k of 56) k*815^n+1 (conjectured k of 16) k*849^n+1 (conjectured k of 16) k*868^n+1 (conjectured k of 78) k*888^n+1 (conjectured k of 13) k*896^n+1 (conjectured k of 22) 
Mark,
As requested in the news thread, when people submit/Email a load of bases with CK<=200, we are asking that they also post which bases they are in these threads, one per line just as Ian has done above so that he doesn't have to do that. If the base isn't proven, then showing search limit and # of k's remaining is also needed for the applicable bases in the post. No more actual detail (primes/which k's are remaining) is needed in the posting. We're trying our best to spread the work out among everyone here. :) Thanks, Gary 
[QUOTE=gd_barnes;214722]Mark,
As requested in the news thread, when people submit/Email a load of bases with CK<=200, we are asking that they also post which bases they are in these threads, one per line just as Ian has done above so that he doesn't have to do that. If the base isn't proven, then showing search limit and # of k's remaining is also needed for the applicable bases in the post. No more actual detail (primes/which k's are remaining) is needed in the posting. We're trying our best to spread the work out among everyone here. :) [/QUOTE] Fortunately I have giving everything I've done to Ian. 
Riesel 611
Riesel Base 611
Conjectured k = 118 Covering Set = 3, 17 Trivial Factors k == 1 mod 2(2) and k == 1 mod 5(5) and k == 1 mod 61(61) Found Primes: 44k's  File attached Remaining k's: 1k  Tested to n=25K 10*611^n1 Trivial Factor Eliminations: 13k's Base Released k weight 1494 
Riesel 645
1 Attachment(s)
R645
CK=18 complete to n=25K k=16 remains Attached are the results Edit: Mathew k=16 is proven composite by partial algebraic factors (Factor 17) You didn't have to test it. Conjecture is proven 
Riesel Base 628
Riesel Base 628
Conjectured k = 186 Covering Set = 17, 37 Trivial Factors k == 1 mod 3(3) and k == 1 mod 11(11) and k == 1 mod 19(19) Found Primes: 104k's  File attached Remaining k's: 1k  Tested to n=25K 149*628^n1 k=36 proven composite by partial algebraic factors Trivial Factor Eliminations: 78k's Base Released k weight 2313 
Sierp 928
Sierpinski 928 is at n=11K
22 primes so far: [CODE] 372*928^10905+1 1903*928^10946+1 2236*928^10935+1 7059*928^10927+1 7318*928^10831+1 8014*928^10330+1 9385*928^10578+1 10365*928^10782+1 10434*928^10765+1 10521*928^10556+1 11229*928^10505+1 15007*928^10676+1 17386*928^10200+1 17778*928^10478+1 18664*928^10282+1 19036*928^10875+1 19267*928^10584+1 19656*928^10412+1 19785*928^10381+1 21007*928^10922+1 24796*928^10451+1 26176*928^10392+1 [/CODE] There are 664 k remaining. Continuing. Files emailed to Gary. 
All times are UTC. The time now is 10:50. 
Powered by vBulletin® Version 3.8.11
Copyright ©2000  2022, Jelsoft Enterprises Ltd.