Sierp 954
 

Sierp Base 954
Conjectured k = 381
Covering Set = 5, 191
Trivial Factors k == 952 mod 953(953)

Found Primes: 361k's -File emailed

Remaining: 18k's - Tested to n=25K _ File emailed

Base Released

Taking S762 and S830

Reserving most of the remaining 15k, 16k, & 17kers to n=25K:

R722
R848
R912
R937

2 more 17kers (at n=5K) will remain to be tested after this.

[QUOTE=gd_barnes;245004]Reserving most of the remaining 15k, 16k, & 17kers to n=25K:

R722
R848
R912
R937
S572
S648
S698
S837


2 more 17kers (at n=5K) will remain to be tested after this.[/QUOTE]

I already have S572 and it will be finishing it to n=25000 in the next hour or so.

You responded too fast. :-) I caught my error before reading your post and removed all of the reserved/completed bases.

S572 and S590 results.

S572 has 11 k's remaining at n=25000.
S590 has 13 k's remaining at n=25000.

These bases are released.

Sierp 593
 

Sierp 593, a 2ker, tested n=25K-100K. Nothing found

Base released - Results emailed

Reservations
 

Reserving S912 & S992 as new to n=25K

R610, a 1-ker, tested n=25K-200K. Nothing found. Base released. Results attached.

Reservations
 

S613 as new to n=25K

Reservations
 

Reserving the following 2kers to n=100K

R696 R706 R774 R784 R785
S684 S695 S707 S724 S737

Sierp 894
 

Sierp Base 894
Conjectured k = 359
Covering Set = 5, 179
Trivial Factors k == 18 mod 19(19) k = = 46 mod 47(47)

Found Primes: 319k's - File emailed

Remaining: 13k's - Tested to n=25K - File emailed

Trivial Factor Eliminations: 25k's

Base Released

Reservations
 

Reserving S1003 and S1017 as new to n=25K

Sierp 620
 

Sierp 620, a 2ker, tested n=25K-100K. Nothing found

Base released - Results emailed

Sierp 638
 

S638 tested from n=25K-100K

52*638^31966+1 is prime

32*638^n+1 is now a 1ker - weight=636

Results emailed - Base released

Riesel 617
 

R617 tested n=25K-100K

14*617^25724-1 is prime

44*617^34964-1 is prime

Conjecture proven - Results emailed

ck=104

R635
 

R635 tested n=25K-100K

38*635^35438-1 is prime

6*635^36162-1 is prime

Conjecture proven - Results emailed

R680
 

R680 tested n=25K-100K

59*680^27590-1 is prime

116*680^58870-1 is prime

Conjecture proven - Results emailed

Three 2k at n=25K proofs in a row. Most impressive! :smile:

Taking S972, S848, S938, and S628. That takes care of conjectures with k < 1000 on the Sierpinski side.

Wow, S938 has 49 remaining k at n = 1000. With a conjectured k of 314, this is absolutely nasty. We'll see what remains once I get to n = 25000.

[QUOTE=rogue;246404]Wow, S938 has 49 remaining k at n = 1000. With a conjectured k of 314, this is absolutely nasty. We'll see what remains once I get to n = 25000.[/QUOTE]

You think that is bad, S992 is the worst of all for CK < 1000. With a CK=332, it has 62 k's remaining at n=[B]5K[/B]! Ian reserved it about a week ago.

The 2nd worst (and worst still open for reservation) is R878 with a CK=292. It has 56 k's remaining at n=5K.

There is nothing else even remotely close to these 2 bases for any CK < 1000; and that includes bases that have already been reserved and/or tested to n=25K. They are why I choose to test upward by # of k's remaining at n=5K instead of CK.

Most of the low-lying fruit has now been tested or reserved.

S762 done
 

8 k remain at n=25000. Released.

S830 done
 

18 k remain at n=25000. Released.

Riesel 694
 

Riesel 694, a 2ker, tested n=25K-100K. Nothing found

Base released - Results emailed

Riesel 634
 

Riesel 634, a 2ker, tested n=25K-100K. Nothing found

Base released - Results emailed

[QUOTE=rogue;246399]Taking S972, S848, S938, and S628. That takes care of conjectures with k < 1000 on the Sierpinski side.[/QUOTE]

Mark,

Ian has already tested S628 to n=25K. See [URL]http://www.mersenneforum.org/showpost.php?p=242765&postcount=955[/URL].

Sorry...I guess we didn't get it removed from the bases remaining to be tested list when it was reserved previously.

Edit: One thing that I thought was strange on this that I just now noticed: You said that these 4 bases take care of all Sierp CK bases < 1000. S628 has a CK = 1072. Did you mean some other base?


Gary

[QUOTE=gd_barnes;246708]Mark,

Ian has already tested S628 to n=25K. See [URL]http://www.mersenneforum.org/showpost.php?p=242765&postcount=955[/URL].

Sorry...I guess we didn't get it removed from the bases remaining to be tested list when it was reserved previously.

Edit: One thing that I thought was strange on this that I just now noticed: You said that these 4 bases take care of all Sierp CK bases < 1000. S628 has a CK = 1072. Did you mean some other base?

Gary[/QUOTE]

OK. I'll take S628 out of my queue.

I had four cores, so I chose four bases. It was just easier that they were all Sierpinski.

Sierp 684
 

Sierp 684, a 2ker, tested n=25K-100K. Nothing found

Base released - Results emailed

Sierp 613
 

Sierp Base 613
Conjectured k = 1536
Covering Set = 5, 53, 307
Trivial Factors k == 1 mod 2(2) and k == 2 mod 3(3) and k == 16 mod 17(17)

Found Primes: 472k's - File emailed

Remaining: 9k's - Tested to n=25K - File emailed

Trivial Factor Eliminations: 286k's

Base Released

S695
 

S695 tested n=25K-100K

Primes found:
8*695^39625+1 is prime

[URL]http://primes.utm.edu/primes/page.php?id=97516[/URL]
2*695^94625+1 is prime

Conjecture proven - Results emailed

Reservations
 

Reserving R618 & S618 as new to n=25K

I'll start the new base R698

Taking R830 to 5K - for now.

[QUOTE=nuggetprime;247686]Taking R830 to 5K - for now.[/QUOTE]

With the exception of some huge-conjectured bases, you will need to test the base to n=10K for me to show it as reserved or its status on the pages. It's too much effort to update each base multiple times at low search depths.

S707
 

S707 tested n=25K-100K

26*707^45893+1 is prime

40*707^n=1 is now a 1ker with a weight = 783

Base released - Results emailed

Reservations
 

Reserving the following 2kers to n=100K

R790 R833 R850 R864 R867
S766 S774 S785 S821 S832

R830 is at 5K,18 k remaining.
Continuing at least to 25K.

I searched R698 to n=5K using PFGW. pl_primes.txt is attached, pl_remain.txt looks as follows:
[code]2*698^n-1
13*698^n-1
20*698^n-1
26*698^n-1
29*698^n-1
53*698^n-1
55*698^n-1
62*698^n-1
64*698^n-1
66*698^n-1
71*698^n-1
88*698^n-1
94*698^n-1
95*698^n-1
97*698^n-1
101*698^n-1
119*698^n-1
133*698^n-1
134*698^n-1
146*698^n-1
158*698^n-1
164*698^n-1
170*698^n-1
177*698^n-1
178*698^n-1
179*698^n-1
187*698^n-1
191*698^n-1
196*698^n-1
202*698^n-1
209*698^n-1
221*698^n-1[/code]

This is pl_trivial:
[QUOTE]18 35 42 52 69 83 86 103 120 124 137 154 165 171 188 205 206 222
[/QUOTE]

I couldn't find any pl_MOB.txt file?

Anyway, I'll now go on sieving the remaining k values and test them as far as I can. 25K at least.

Peter,

Everything looks good. There are no MOB for this particular base. As points of future reference: (1) It's easier for us if you attach the k's remaining and primes in a single zip file to the post. The lists can get very long. (2) I won't show anything on the pages until the search depth has reached at least n=10K.

Thanks for the work! :smile:


Gary

S724
 

S724 tested n=25K-100K

30*724^28548+1 is prime

9*724^n+1 is now a 1ker with a weight = 1573

Base released - Results emailed

I'm new to CRUS, so please tell me if I'm doing anything wrong.

Reserving S1029 n=100k-150k

Status R698
 

I am at n=10K now, two more primes:

101*698^6886-1
53*698^7304-1

Now for some more sieving...

[QUOTE=Mattyp101;248521]I'm new to CRUS, so please tell me if I'm doing anything wrong.

Reserving S1029 n=100k-150k[/QUOTE]


Welcome to CRUS Mattyp! As long as you are aware that your reservations will take several CPU months, it seems fine to us. You can use srsieve followed by sr1sieve for sieving and either PFGW or LLR for testing.

If you have any questions, please let us know.

Good luck!

S1017
 

Sierp Base 1017
Conjectured k = 1494
Covering Set = 7, 13, 31
Trivial Factors k == 1 mod 2(2) and k == 126 mod 127(127)

Found Primes: 717k's - File emailed

Remaining: 23k's - Tested to n=25K - File emailed

Trivial Factor Eliminations: 6k's

Base Released

[QUOTE] I'm new to CRUS, so please tell me if I'm doing anything wrong.

Reserving S1029 n=100k-150k
[/QUOTE]

Welcome aboard. Nice choice for a first reservation. :cool:

[QUOTE=MyDogBuster;248678]Welcome aboard. Nice choice for a first reservation. :cool:[/QUOTE]

:grin: Why thank you.

I'm also going to take all 13 k's of S1021 for n=25K-100K

[QUOTE=Mattyp101;248689]:grin: Why thank you.

I'm also going to take all 13 k's of S1021 for n=25K-100K[/QUOTE]

Mostly out of curiosity: How many cores do you have? How many cores are you planning to put towards the two things you've reserved? Looks like a whole lot of work to me, but I know how some people have dozens or hundreds of cores at their command. :smile:
By the way, in case you're not familiar with it, such a range (i.e. >2 k's) would be best sieved by srsieve to start (if the sieve wasn't started already) and then sr2sieve for the sieving (for 1 or 2 k's, sr1sieve is usually best). Between running srsieve and sr2sieve, (or at any time, really) you might also want to run [URL="http://www.mersenneforum.org/showthread.php?p=209045#post209045"]this hiddenpowers script[/URL] (be sure to read the documentation and note the sieve file must be NewPGen-like, i.e. each line being like "k n") to remove some numbers that have algebraic factors and can't be prime.

I have a quad core, at 3.4 GHz, running 24/7, but could put on an extra 4 if it comes to it. By my estimates (very rough estimates), the multi k range will take around two months, possibly less if I find many factors. Thanks for the tip about the script. Wouldn't the factors just be found by one of the sieving programs anyway?

[QUOTE=Mattyp101;248695]Thanks for the tip about the script. Wouldn't the factors just be found by one of the sieving programs anyway?[/QUOTE]

No, because the factorizations found are often a significant fraction of the size of the number, whereas the sieve depth is a tiny portion of it.

As a rough estimate, I would say that your 2 efforts combined will take ~1 CPU year (possibly longer) or ~3 months on a quad running 24x7. These larger bases take much longer at the same n-range than much smaller bases.

Tim, since he is running the Sierp side, there are unlikely to be any k's where algebraic factors can remove some of the n's. The only small exception, since neither base is a perfect cube or higher power, would be if any of the k's were a perfect cube or higher power (upon a quick glance, I don't see any). Personally I wouldn't suggest that he mess with it until he's run the conjectures a little more.

Mattyp, one hint that I always give new people: It's very easy to reserve way too much and then get bored before the effort is done. Please do not bite off more than you can chew. It's better to start out small and work your way up to larger reservations. I'm not making a judgment as to whether yours is too large; it's just a little friendly advice. :-)

[QUOTE]As a rough estimate, I would say that your 2 efforts combined will take ~1 CPU year (possibly longer) or ~3 months on a quad running 24x7. These larger bases take much longer at the same n-range than much smaller bases.
[/QUOTE]

You know what, you may be right there :smile:. Now that it's been running for a little while, it's looking like it might take a fair but longer than I thought. I probably could manage it all, but I like to move around a little. So, with that in mind, I would like to half the max n of both my reservations. That is:

S1029, n=100K-125K, and
S1021, n=25K-50K.

[QUOTE=Mattyp101;248776]You know what, you may be right there :smile:. Now that it's been running for a little while, it's looking like it might take a fair but longer than I thought. I probably could manage it all, but I like to move around a little. So, with that in mind, I would like to half the max n of both my reservations. That is:

S1029, n=100K-125K, and
S1021, n=25K-50K.[/QUOTE]

Ah, that sounds quite manageable for a quad and allows to get your feet wet without a large commitment at this point. If you want to start out sieving larger ranges and extend your reservation later on, that would work well.

The following 15, 16, & 17kers bases are complete to n=25K and released:

R722; 6 primes found for n=5K-25K; 11 k's remaining
R848; 5 primes found for n=5K-25K; 10 k's remaining
R912; 5 primes found for n=5K-25K; 12 k's remaining
R937; 5 primes found for n=5K-25K; 11 k's remaining

Only one more 17ker to go.

Taking the remaining Riesel conjectures for conjectured k < 1000. That is:

R972
R842
R878
R938
R950
R647
R748

When I complete these to n=25000, then all bases for conjectured k < 1000 should be completed to n=25000.

S848 done to n=25000 and released. 15 k remain.

Reserving all remaining bases to n=25K that have < 20 k's remaining at n=5K as follows:

R567
R663
R957
S603

S938 done to n=25000 and released. 24 k remain.

S972 done to n=25000 and released. 16 k remain.

R696
 

R696 tested n=25K-100K - Nothing found

Results emailed - Base released

R706
 

R706 tested n-25K-100K

155*706^38075-1 is prime

83*706^n-1 is now a 1ker with a weight = 1206

Results emailed - Base released

R698
 

Testing has reached n=25K

66*698^16949-1 is prime! (P = 3)
88*698^19437-1 is prime! (P = 3)
179*698^23924-1 is prime! (P = 3)

Extending reservation to n=50K

R774
 

R774 tested n=25K-100K - Nothing found

Results emailed - Base released

R784
 

R784 tested n=96.4K-100K - Nothing found

Results emailed - Base released

R785
 

R785 tested n=25K-100K

16*785^26599-1 is prime

28*785^51277-1 is prime

Conjecture proven - Results emailed

Reservations
 

Reserving the following 2kers to n=100K.

R875 R887 R888 R945 R964
S833 S835 S853 S875 S883

If I did my homework correctly, that will leave me with just 9 more to reserve to complete all the 2ker's to n=100K.

[QUOTE=MyDogBuster;251149]Reserving the following 2kers to n=100K.

R875 R887 R888 R945 R964
S833 S835 S853 S875 S883

If I did my homework correctly, that will leave me with just 9 more to reserve to complete all the 2ker's to n=100K.[/QUOTE]

R888 is already at n=100K.

[QUOTE]R888 is already at n=100K.[/QUOTE]

I really did check them out. Maybe next time I should actually look at the numbers. LOL Thanx

S992
 

Sierp Base 992
Conjectured k = 332
Covering Set = 3, 331
Trivial Factors k == 990 mod 991(991)

Found Primes: 279k's - File emailed

Remaining: 51k's - Tested to n=25K - File emailed

Base Released

Riesel base 647 completed to n=25000 and released. 31 k remain.

S766
 

S766 tested n=25K-100K - Nothing found

Results emailed - Base released

Reserving R1021, R1025 and R1029 to n=1M

Riesel base 748 done to n=25000 and released. 12 k remain.

[QUOTE=Puzzle-Peter;251559]Reserving R1021, R1025 and R1029 to n=1M[/QUOTE]

Are you sure you want to reserve so much on such high bases? Even if you prime 2 of the 4 k's fairly quicky, you're probably still looking at 5-10 CPU years of work. How about I put you down for a reservation to n=200K to start with? If you near that depth and want to continue, then you can extend the reservation. Searching bases > 1000 to n=1M is much different than searching bases < 100 to n=1M.

[QUOTE=gd_barnes;251637]Are you sure you want to reserve so much on such high bases? Even if you prime 2 of the 4 k's fairly quicky, you're probably still looking at 5-10 CPU years of work. How about I put you down for a reservation to n=200K to start with? If you near that depth and want to continue, then you can extend the reservation. Searching bases > 1000 to n=1M is much different than searching bases < 100 to n=1M.[/QUOTE]


That's fine. I have the sieve files with candidates to 1M so whenever I get bored, I'll provide the rest of my sieve files.

R698 status
 

R698 reached n=50K. Extending reservation to 100K.

Primes from 25K to 50K:

64*698^29339-1
71*698^44086-1
94*698^47531-1
95*698^26270-1
134*698^37348-1
177*698^40043-1

That's 21K's left to eliminate...

[QUOTE=Puzzle-Peter;251662]R698 reached n=50K. Extending reservation to 100K.[/QUOTE]

Peter,

I usually ask that people provide the results (lresults.txt or pfgw.out) or completed_tests file for tests n>25K. Can you provide those? If they're too big to zip up and attach to a post, please Email them to me at:
gbarnes017 at gmail dot com


Thanks,
Gary

[QUOTE=gd_barnes;251678]Peter,

I usually ask that people provide the results (lresults.txt or pfgw.out) or completed_tests file for tests n>25K. Can you provide those? If they're too big to zip up and attach to a post, please Email them to me at:
gbarnes017 at gmail dot com


Thanks,
Gary[/QUOTE]
Also note: if the results are in PRPnet completed_tests.log format, they will need to be processed and sorted before they're ready for Gary. You can send those over to me (please include the original sieve file used!) at [email]max@noprimeleftbehind.net[/email] and I'll take it from there. :smile:

It's an LLR lresults file. So I send it to Gary, right?

[QUOTE=Puzzle-Peter;251684]It's an LLR lresults file. So I send it to Gary, right?[/QUOTE]
Yes, correct. That also goes for PFGW results.out files and any other "manual" (not LLRnet or PRPnet) results. It's only the ones from servers that I have to process since they're listed in the order the results came in, not in the order the original sieve file had them. (That, and servers will occasionally lose a result here and there, so I check them against the original sieve file to make sure everything's there. Recent versions of PRPnet have had no problems with such lost results, but I still check them all anyway to be sure.)

S821
 

S821 tested n=25K-100K - Nothing found

Results emailed - Base released

Riesel base 842 completed to n=25000 and released. 27 k remain.

Interesting. R841 and R842 both have 27 k's remaining at n=25K with much different conjectures.

S832
 

S832 tested n=25K-100K - Nothing found

Results emailed - Base released

Reserving the 1kers S1004 & R1019 to at least n=200K (sieving up to n=1M)

[QUOTE=Mattyp101;252266]Reserving the 1kers S1004 & R1019 to at least n=200K (sieving up to n=1M)[/QUOTE]

There's a sieved file 150K < n < 200K for R1019 to save you some work. Maybe you don't need to go farther than 200K.

[URL]http://www.noprimeleftbehind.net/crus/sieve-riesel-base1019-150K-200K.txt[/URL]

S774
 

S774 tested n=25K-100K - Nothing found

Results emailed - Base released

Riesel base 878 completed to n=25000 and released. 45 k remain.

Reserving R837 as new to n=25k

Reserving R927 as new to n=25k

R655 &R687
 

Reserving R655 and R687 as new to n=25K

[QUOTE=Puzzle-Peter;252497]Reserving R927 as new to n=25k[/QUOTE]

FYI:
k=144, 2116, and 4900 are eliminated by a factor of 29 on odd-n and algebraic factors on even-n and do not need to be tested.

There are no such k's on R837.

[QUOTE=gd_barnes;252547]FYI:
k=144, 2116, and 4900 are eliminated by a factor of 29 on odd-n and algebraic factors on even-n and do not need to be tested.

There are no such k's on R837.[/QUOTE]


Thanks!

Reservations
 

Reserving S655 and S687 as new to n=25K

R790
 

R790 tested n=25K-100K

20*790^40772-1 is prime

48*790^n-1 is now a 1ker with a weight of 1343

Results emailed - Base released

Riesel base 938 done to n=25000 and released. 17 k remain.

Edit: The files show 27k's remaining and the total k's with the 270 primes does = 297 which it should.
I'll assume a typo. Ian

Mark,

115*938*2223-1 is composite. It has a factor of 19.

Testing on my part found that 115*938^22223-1 is prime. It was only a lucky guess that a "2" was left out of the exponent.

I don't run primality proofs on everyone's primes, although I probably should. It just takes too much time with the # of primes that I get in on a daily bases. I only found this because I have files of primes to n=5K for many of the remaining bases with CK < 10K. It came out because with the # of primes that you have for n>5K (a total of 8), using my file of k's remaining for n<=5K (a total of 36), I showed that there should have been 28 (not 27) k's remaining. Changing k=115 to the correct prime so that there were 9 primes for n>5K put things in balance.

My question is: Why are primes being manually typed into files? That is the only explanation for a missing "2" in the exponent of a prime. I have griped about this before and have requested that people not do it. Finding this causes me to question the integrity of the k's remaining on many of your bases. How am I to know that you are not taking your file of k's remaining at n=1K and manually removing the k's found prime for n=1K-25K? I don't.

For everyone, based on this, here is a requirement for what I need in the future for testing up to n=25K:
1. A file of scripted primes and k's remaining at your nominal testing limit of n=1K or 2.5K or 5K.
2. A file of primes for n=1K (or 2.5K or 5K) to 25K.
3. Optional: A file of k's remaining at n=25K.

The files need to come directly from PFGW/LLR/PRPnet with one exception: The files can be sorted by k or n using an automated program of your choice but cannot in any other way be manipulated, manually typed in to, etc. The primes from #1 and #2 cannot be combined. There are several people that already send me separate files like the above and I'm much more comfortable with it.

If you don't include the optional file in #3, it's very easy for me to take k's remaining in #1 and subtract primes found in #2. I would actually much prefer doing that over getting manually manipulated files for smaller conjectured bases. I'd only ask for the file in #3 on large CK bases like S63 and if you have an automated way of creating them.

The math is too important and it's too easy to automate tasks to have primes manually typed into the files and potentially mess up the proofs if the k is typed incorrectly or is incorrectly removed from a k's remaining file.


Thank you,
Gary

edit...P.S. The above only applies to bases that are both scripted to a small limit and then sieved/tested to n=25K. This would exclude base 3 if it is fully scripted to n=25K, which is a common way of testing solely that base. All that I need there are primes and k's remaining.