[QUOTE=gd_barnes;252748]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..[/QUOTE]

Thanks for that catch. Yes, it was typed in. I only had a few numbers typed into the list as it was easier for me than copy & paste. I'll be more careful for the two remaining bases that I have started. Going forward it shouldn't be a problem.

Status update:
R830 is at n=17300,15 k remaining.
Slow but going.

Nugget

R833
 

R833 tested n=25K-100K

28*833^53769-1 is prime

104*833^n-1 is now a 1ker with a weight of 827

Results emailed - Base released

S1003
 

Sierp Base 1003
Conjectured k = 4768
Covering Set = 5, 29, 251
Trivial Factors k == 1 mod 2(2) and k == 2 mod 3(3) and k == 166 mod 167(167)

Found Primes: 1539k's - File emailed

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

Trivial Factor Eliminations: 804k's

Base Released

[QUOTE=rogue;252771]Thanks for that catch. Yes, it was typed in. I only had a few numbers typed into the list as it was easier for me than copy & paste. I'll be more careful for the two remaining bases that I have started. Going forward it shouldn't be a problem.[/QUOTE]

Copy & paste is not necessary if you zip up 2 separate primes files; one for scripted primes and one for primes from sieved k's. It's the most accurate way to go.

[QUOTE=MyDogBuster;252855]Sierp Base 1003

Found Primes: 1539k's - File emailed

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

Trivial Factor Eliminations: 804k's

Base Released[/QUOTE]

Can you check if you sent? I don't seem to have anything yet.

Edit: Sent

Riesel base 950 done to n=25000 and released. 14 k remain.

S912
 

Sierp Base 912
Conjectured k = 331
Covering Set = 11, 83
Trivial Factors k == 910 mod 911(911)

Found Primes: 313k's - File emailed

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

Base Released

[QUOTE=rogue;252997]Riesel base 950 done to n=25000 and released. 14 k remain.[/QUOTE]

The submission is rejected until I receive the files correctly. Did you read my last post?

The following bases are complete to n=25K and released:

R567; 8 primes found for n=5K-25K; 11 k's remaining
R663; 5 primes found for n=5K-25K; 12 k's remaining
R957; 7 primes found for n=5K-25K; 12 k's remaining
S603; 10 primes found for n=5K-25K; 8 k's remaining


All bases with < 20 k's remaining at n=5K are now completed to n=25K. :smile:

Reserving R1006 as new to n=25K.

R972 completed to n=25000 and released. 15 k remain.

R850
 

R850 tested n=25K-100K

339*850^57302-1 is prime

221*850^n-1 is now a 1ker with a weight of 1414

Results emailed - Base released

[QUOTE=rogue;253057]R972 completed to n=25000 and released. 15 k remain.[/QUOTE]

Rejection #1:
[URL]http://www.mersenneforum.org/showpost.php?p=253006&postcount=1076[/URL]

R972 is now rejection #2.

Mark, I'm not jacking around here. Either you submit the stuff how I asked or I'll just delete your submissions and add the bases back to the "to be tested" threads.

This is ridiculous. Submitting a remaining and a prime file after scripting only and then a subsequent primes file for n=1K (or 2.5K or 5K) to 25K exactly as it/they came out of PFGW/LLR/PRPnet is not rocket science.

[QUOTE=gd_barnes;253107]R972 is now rejection #2.

Mark, I'm not jacking around here. Either you submit the stuff how I asked or I'll just delete your submissions and add the bases back to the "to be tested" threads.[/QUOTE]

Why are you rejecting? I don't see a reason.

As I don't intend to start any new bases, this shouldn't be an issue going forward.

R1029
 

One k down:

36*1029^55979-1 is prime! (P = 6)

So this is a 1k'er now. I'll stay on the last k=26 for a little longer...

[QUOTE=rogue;253135]Why are you rejecting? I don't see a reason.

As I don't intend to start any new bases, this shouldn't be an issue going forward.[/QUOTE]

[URL]http://www.mersenneforum.org/showpost.php?p=252748&postcount=1067[/URL]

[QUOTE=Puzzle-Peter;253310]One k down:

36*1029^55979-1 is prime! (P = 6)

So this is a 1k'er now. I'll stay on the last k=26 for a little longer...[/QUOTE]

Cool! :-)

What is your current test limit for k=26? For now, I'll show it at n=56K.

[QUOTE=gd_barnes;253317][URL]http://www.mersenneforum.org/showpost.php?p=252748&postcount=1067[/URL][/QUOTE]

Would you prefer me to provide a list of primes (from PRPNet) ordered by k? If so, do you still want me to provide the other lists, i.e. primes for n < 2000 and remaining k?

[QUOTE=rogue;253324]Would you prefer me to provide a list of primes (from PRPNet) ordered by k? If so, do you still want me to provide the other lists, i.e. primes for n < 2000 and remaining k?[/QUOTE]

I'm tired of repeating myself so I'll quote exactly what I've typed before and you can tell me what it is that cannot be understood:

[quote]
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.
[/quote]

[quote]
This is ridiculous. Submitting a remaining and a prime file after scripting only and then a subsequent primes file for n=1K (or 2.5K or 5K) to 25K exactly as it/they came out of PFGW/LLR/PRPnet is not rocket science.
[/quote]

I do not care how the primes are ordered for n>2K. They just need to be as they came out of PRPnet. No manipulation or combining with other files, i.e. primes from the starting-bases script.

The above files are virtually exactly what I get from everyone else on new bases except one other person and that other person quickly changed to the above after my recent post. Once again, this is not rocket science.

[QUOTE=gd_barnes;253318]Cool! :-)

What is your current test limit for k=26? For now, I'll show it at n=56K.[/QUOTE]

Hard to say. I sieved until it felt save to LLR n=25K to 100K which I divided across several cores. So there will be completed tests in the lower 30K region, lower 50K, lower 60K etc.

For k=36 I finished all tests below the prime to make sure it's the smallest. I'll do the same for k=26 in case I find one.

R864
 

R864 tested n=25K-100K - nothing found

Results emailed - Base released

Is this better? I did not remove k with found primes from pl_remain.txt, but the other post will have it in that form.

[QUOTE=Puzzle-Peter;253416]Hard to say. I sieved until it felt save to LLR n=25K to 100K which I divided across several cores. So there will be completed tests in the lower 30K region, lower 50K, lower 60K etc.

For k=36 I finished all tests below the prime to make sure it's the smallest. I'll do the same for k=26 in case I find one.[/QUOTE]

I see. I'll change the search limit to n=30K since that's its contiguously searched range at this point.

Here's a hint for dividing sieve files across multiple cores without running a server when you have fewer k's remaining than cores you are using to search them. I'll use 4 cores as an example here:

1. Paste the sieve file into a spreadsheet in column A.

2. Manually type the numbers "1", "2", "3", and "4" in the first 4 rows of column B and copy them the length of the file so that you have a 1,2,3,4,1,2,3,4,1,2,3,4,etc. repeating sequence all the way down.

3. Sort the file by column B primary and column A secondary. All "1"'s, "2"'s, etc. will now be together. This will work well for your effort. In some cases, though, since column A will be an alphanumeric sort (since there is a space in it), if your range crosses over a power of 10 such as from n=50K-150K, you would have to parse out the n-value into column C and use that as a secondary sort to get it to sort correctly. Fortunately that is not an issue for n=25K-100K.

4. Put all the lines with a "1" in them in core 1, lines with a "2" in core 2, etc. and start all cores at the same time.

5. When sending the results, you can either send all 4 files or combine them all and sort them by n-value primary and k-value secondary.

The machine will now search all cores at almost the exact same n-range. You can still go ahead and use the stop-on-prime option so that one core will stop when/if it finds a prime. You'll have to manually stop the other cores.

This works best when you have more k's than cores running them. Then you can divide it up by ranges of k so that the stop-on-prime stops searching a k on the applicable core that it should. But this is the best that you can (easily) do for a single k across multiple cores without a server (that I am aware of) to avoid a lot of unnecessary searching.


Gary

[QUOTE=rogue;253453]Is this better?[/QUOTE]

Barely.

First, I rejected 2 bases. You only included 1. Where is the other one?

Second, wouldn't it be easier to just include the pfgw.log file that the server writes out for the n=2K-25K primes? That's what Ian, Mathew, and others do when searching new bases with a server. It's also exactly what I save off when doing my own searches with a server. Doing an SQL database query to get the primes means that an unnecessary header name and dashes are included in the primes file. It also means that the file is sorted in random fashion with neither k's nor n's in proper order. The pfgw.log file has them in proper n-value order and is quick and easy to save off. I suppose I can live with the SQL primes query. I'll just sort it myself. At least it's a file directly from the server that obviously has not been manipulated in some fashion. That's what I'm mainly concerned about.

You just seem to be making this so very difficult.

R867
 

R867 tested n=25K-100K

6*867^61410-1 is prime

8^867^n-1 is now a 1ker with a weight of 836

Results emailed - Base released

[QUOTE=gd_barnes;253473]
Here's a hint for dividing sieve files across multiple cores without running a server when you have fewer k's remaining than cores you are using to search them. I'll use 4 cores as an example here:

[....]

[/QUOTE]

This is so easy that I have no idea why I didn't think about it myself.

Thanks!

[QUOTE=gd_barnes;253475]Barely.

First, I rejected 2 bases. You only included 1. Where is the other one?

Second, wouldn't it be easier to just include the pfgw.log file that the server writes out for the n=2K-25K primes? That's what Ian, Mathew, and others do when searching new bases with a server. It's also exactly what I save off when doing my own searches with a server. Doing an SQL database query to get the primes means that an unnecessary header name and dashes are included in the primes file. It also means that the file is sorted in random fashion with neither k's nor n's in proper order. The pfgw.log file has them in proper n-value order and is quick and easy to save off. I suppose I can live with the SQL primes query. I'll just sort it myself. At least it's a file directly from the server that obviously has not been manipulated in some fashion. That's what I'm mainly concerned about.

You just seem to be making this so very difficult.[/QUOTE]
A little clarification: the PRPnet server does [I]not[/I] produce a pfgw.log file. It does produce PRP.log, but that gives the primes in the order they were found (not necessarily n order) and in full PRPnet results format with username, email, etc. If Ian is producing a pfgw.log file from PRPnet, then he is first massaging his PRPnet data in some way or another to get it into that format. (As for Mathew...are you sure he's using a PRPnet server to start new bases? I run a private server for him, but we've only ever used that for continuing existing bases at n>25K.)

[QUOTE]If Ian is producing a pfgw.log file from PRPnet, then he is first massaging his PRPnet data in some way or another to get it into that format.[/QUOTE]

I have a VBScript that extracts the primes from the PRP.log file.

[QUOTE=mdettweiler;253525]A little clarification: the PRPnet server does [I]not[/I] produce a pfgw.log file. It does produce PRP.log, but that gives the primes in the order they were found (not necessarily n order) and in full PRPnet results format with username, email, etc. If Ian is producing a pfgw.log file from PRPnet, then he is first massaging his PRPnet data in some way or another to get it into that format. (As for Mathew...are you sure he's using a PRPnet server to start new bases? I run a private server for him, but we've only ever used that for continuing existing bases at n>25K.)[/QUOTE]

I was aware of the file name and what it writes out. I just typed the wrong name. Ian removes the extra information. I may have been mistaken on Mathew using servers to search new(er) bases. Regardless, I'd much rather get that file than an SQL query of primes in random order, especially for small-conjectured bases.

Shouldn't a server write out a "normal" primes file without all of the extra info? Both LLRnet and PRPnet have the same issue in that regard. Karsten's script writes out a "normal file" of primes on the client side but that's not very helpful if you're using multiple machines.

[QUOTE]Shouldn't a server write out a "normal" primes file without all of the extra info?[/QUOTE]I would think so. We are looking for primes. The rest of the stuff in there just makes it harder to read and work with. JMHO

[QUOTE=gd_barnes;253535]I was aware of the file name and what it writes out. I just typed the wrong name. Ian removes the extra information. I may have been mistaken on Mathew using servers to search new(er) bases. Regardless, I'd much rather get that file than an SQL query of primes in random order, especially for small-conjectured bases.

Shouldn't a server write out a "normal" primes file without all of the extra info? Both LLRnet and PRPnet have the same issue in that regard. Karsten's script writes out a "normal file" of primes on the client side but that's not very helpful if you're using multiple machines.[/QUOTE]
The tricky part is that a flat text file would generally have to be written out in the order that primes are found--i.e., somewhat random order. For a manual client, this is not a problem, because it processes a file sequentially; on a server, pairs are handed out sequentially, but different clients return results at different times, so sometimes (particularly at small n) primes can come in out of order.

I imagine it would be trivial to add support in prpserver for a second prime log file that just logs the actual primes, one per line. But the file would still have some primes out of order (unless n is large enough that the primes are far and few between and they never come in out of order).

[QUOTE=mdettweiler;253539]The tricky part is that a flat text file would generally have to be written out in the order that primes are found--i.e., somewhat random order. For a manual client, this is not a problem, because it processes a file sequentially; on a server, pairs are handed out sequentially, but different clients return results at different times, so sometimes (particularly at small n) primes can come in out of order.

I imagine it would be trivial to add support in prpserver for a second prime log file that just logs the actual primes, one per line. But the file would still have some primes out of order (unless n is large enough that the primes are far and few between and they never come in out of order).[/QUOTE]

I'm aware of that issue. Having a very small percentage of primes out of order would not be a problem. As a general rule, a majority of people only use servers for searching at higher n-ranges (n>25K) so they would be in order 99.9%+ of the time.

I found and fixed my mistake with r950.

[QUOTE=gd_barnes;253541]I'm aware of that issue. Having a very small percentage of primes out of order would not be a problem. As a general rule, a majority of people only use servers for searching at higher n-ranges (n>25K) so they would be in order 99.9%+ of the time.[/QUOTE]

And there are ways to order properly from PRPNet:

select SierpinskiRieselPrime from CandidateGroupStats where SierpinskiRieselPrime is not null order by k;

[QUOTE=rogue;253548]And there are ways to order properly from PRPNet:

select SierpinskiRieselPrime from CandidateGroupStats where SierpinskiRieselPrime is not null order by k;[/QUOTE]

Ah, very good. That would be very helpful.

[QUOTE=rogue;253547]I found and fixed my mistake with r950.[/QUOTE]

This is still not the files that I asked for Mark. Reread my posts yet again please.

Edit: Please see your PM. I think it's past time to stop cluttering the thread here.

[QUOTE=Mattyp101;253028]Reserving R1006 as new to n=25K.[/QUOTE]

This is not marked on the reservation and condensed pages, but the base is gone from the untested conjectures thread.

S687
 

Sierp Base 687
Conjectured k = 7956
Covering Set = 5, 43, 109
Trivial Factors k == 1 mod 2(2) and k == 6 mod 7(7)

Found Primes: 3353k's - File emailed

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

Trivial Factor Eliminations: 568k's

MOB Eliminations: 2k's - File emailed

Base Released

S833
 

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

Results emailed - Base released

R1006 completed to n=25K
Primes found: 793k's
Trivial factors: 729k's
Algebraic factors: 1k (k=900)
k's remain: 14k's

Base Released

Third time's the charm?

I reran the script, then put the primes from PRPNet into a separate file. AFAICT that should meet your requirements. If not, please be specific in how it does not meet them.

I see on the stats page the R992 is "just started", but I saw in a previous post that MyDogBuster sent in the results. Something is amiss.

[QUOTE]I see on the stats page the R992 is "just started", but I saw in a previous post that MyDogBuster sent in the results. Something is amiss. [/QUOTE]

R992 is reserved by henryzz. I worked on S992 and finished on Feb 4th.

[QUOTE=MyDogBuster;253844]R992 is reserved by henryzz. I worked on S992 and finished on Feb 4th.[/QUOTE]

Oops. My bad.

[QUOTE=MyDogBuster;253844]R992 is reserved by henryzz. I worked on S992 and finished on Feb 4th.[/QUOTE]
Which reminds I held off posting it during the last NPLB rally until afterwards(turned out to be a long while afterwards).
Results attached.

Reserving R642 to n=25K

[QUOTE=rogue;253836]Third time's the charm?

I reran the script, then put the primes from PRPNet into a separate file. AFAICT that should meet your requirements. If not, please be specific in how it does not meet them.[/QUOTE]

Looks good.

[QUOTE=gd_barnes;253923]Looks good.[/QUOTE]

Finally! I'm glad that this issue has been resolved to your satisfaction. BTW, you mentioned that there was another base that you had rejected, yet I didn't see any "just started" reservations on the CRUS status page that appeared to be mine. I thought it was r938, but that looks to be correct, i.e. completed to n=25000.

[QUOTE=rogue;253925]Finally! I'm glad that this issue has been resolved to your satisfaction. BTW, you mentioned that there was another base that you had rejected, yet I didn't see any "just started" reservations on the CRUS status page that appeared to be mine. I thought it was r938, but that looks to be correct, i.e. completed to n=25000.[/QUOTE]

You already submitted the corrected files for it. lol

Status update R1029
 

Testing 26*1029^n-1 has reached n=100K, nothing found. Going on to n=200K

Reservations
 

Reserving the last of the 2ker's to n=100K

R988 R995
S887 S889 S953 S987 S998 S1001

[QUOTE=MyDogBuster;254029]Reserving the last of the 2ker's to n=100K

R988 R995
S887 S889 S953 S987 S998 S1001[/QUOTE]

Don't forget S214 that you dropped from 4 to 2 k's. :smile:

[QUOTE]Don't forget S214 that you dropped from 4 to 2 k's. :smile:[/QUOTE]

Thanks, forgot all about that one.:redface:

S835
 

S835 tested n=50K-100K - Nothing found

Results emailed - Base released

R618
 

Riesel Base 618
Conjectured k = 2517
Covering Set = 7, 37, 211
Trivial Factors k == 1 mod 617(617)

Found Primes: 2448k's - File emailed

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

Trivial Factor Eliminations: 4k's

MOB Eliminations: 3k's - File emailed

Base Released

R542
 

Riesel Base 542
Conjectured k = 182
Covering Set = 3, 181
Trivial Factors k == 1 mod 541(541)

Found Primes: 159k's - File emailed

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

Base Released

Sierp 928
 

Sierp 928 is complete to n=18K.

14 primes:
[CODE]25282*928^17006+1
27715*928^17014+1
6487*928^17045+1
25917*928^17088+1
268*928^17136+1
2470*928^17165+1
13960*928^17268+1
14775*928^17478+1
3966*928^17500+1
17341*928^17583+1
21475*928^17614+1
6909*928^17782+1
2119*928^17898+1
363*928^17998+1
[/CODE]

Continuing.

R837
 

R837 tested to n=25k

Scripting to n=5k left 30k's
LLR to n=25k found 13k's -> 17k's remaining.

Base released.

S1021 Completed to n=50K
1786*1021^42066+1 is Prime
1278*1021^44186+1 is Prime
11k's remain
Base released.

R875
 

R875 tested n=25K-100K

50*875^53254-1 is prime

38*875^n-1 is now a 1ker with a weight of 1847

Results emailed - Base released

R698 update
 

R698 tested n=50k to n=100k.

2 primes found:
26*698^53474-1
196*698^54737-1

17 k's remaining. Results emailed. Going on to n=150k.

[QUOTE=Puzzle-Peter;254536]R698 tested n=50k to n=100k.

2 primes found:
26*698^53474-1
196*698^54737-1

17 k's remaining. Results emailed. Going on to n=150k.[/QUOTE]

Peter,

Per [URL="http://www.mersenneforum.org/showpost.php?p=251662&postcount=1046"]this post[/URL], you had 21 k's remaining at n=50K. The 2 primes here leaves 19 k's remaining at n=100K (vs. 17). Doing a balancing of everything confirms that there were 32 k's remaining at n=5K and 13 k's with a prime for n=5K-100K so indeed there are 19 k's remaining.

[QUOTE=gd_barnes;254576]Peter,

Per [URL="http://www.mersenneforum.org/showpost.php?p=251662&postcount=1046"]this post[/URL], you had 21 k's remaining at n=50K. The 2 primes here leaves 19 k's remaining at n=100K (vs. 17). Doing a balancing of everything confirms that there were 32 k's remaining at n=5K and 13 k's with a prime for n=5K-100K so indeed there are 19 k's remaining.[/QUOTE]

You are right of course. I had 19 remaining k's in mind and for some reason subtracted the two newly found ones again. Sorry for the confusion!

R625
 

Reserving the 91k's that are at n=15K to n=25K

R1029
 

26*1029^n-1 tested from n=100k to n=200k nothing found.

Results plus sieve file attached. Sieve file goes up to n=1M, sieved to P=10e12.

Base released.

Reservations
 

More 1ker's

Reserving S797, S914, R566, R650 and R706 to n=200K

Reserving S841 to n=25K.

[QUOTE=MyDogBuster;254797]Reserving the 91k's that are at n=15K to n=25K[/QUOTE]

[QUOTE=gd_barnes;255306]Reserving S841 to n=25K.[/QUOTE]

Suggestion (from old times): For these, try the speed of tests in bases 5 and 29, resp.

Example:
[CODE]852*625^15007-1 is composite: RES64: [E5A0E1CE02AF5DAB] (32.6333s+0.0003s)
852*625^15013-1 is composite: RES64: [BA3CA43E48807023] (32.5645s+0.0004s)
852*625^15014-1 is composite: RES64: [48B305268B6A1153] (32.6947s+0.0005s)
852*625^15023-1 is composite: RES64: [CCC088F9BE01EC40] (32.5024s+0.0004s)

vs. (an equivalent task)

852*5^60028-1 is composite: RES64: [E5A0E1CE02AF5DAB] (15.5125s+0.0003s)
852*5^60052-1 is composite: RES64: [BA3CA43E48807023] (15.5065s+0.0004s)
852*5^60056-1 is composite: RES64: [48B305268B6A1153] (15.4888s+0.0005s)
852*5^60092-1 is composite: RES64: [CCC088F9BE01EC40] (18.0302s+0.0004s)

[/CODE]
My 2c.

Sierp 928
 

S928 complete to n=19k

[CODE]6541*928^18105+1
5908*928^18311+1
19336*928^18275+1
21258*928^18296+1
20796*928^18617+1
25863*928^18971+1
18871*928^18509+1
17106*928^18617+1
16431*928^18809+1
[/CODE]

Nine primes. Continuing.

R927
 

R927 done to n=25k

scripting to n=5k left 110 k's

35 primes found for 5001<n<25000

-> 75 k's remaining. Files attached, base released.

R887
 

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

Results emailed - Base released

I would like to reserve R530 to n=50K

R625
 

R625 tested 15K-25K

9 primes found - 82 remain

Results emailed - Base released

R945
 

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

Results emailed - Base released

R530 is complete to n=50K

No primes.

Attached are the results and a sieve file to n=100K

R964
 

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

Results emailed - Base released

S987
 

S987 tested nn=25K-100K

92*987^28564+1 is prime

142*987^45547+1 is prime

Conjecture proven

Results emailed - Base released

Nice ck of 170

R1021
 

174*1021^121880-1 is prime!

Conjecture proven

R642
 

R642 tested to n=25k

Scripting to n=2000 left 183 k's
91 primes found from n=2001 to 25000
92 k's remaining
Base released

S875
 

S875 tested n=25K-100K

38*875^52517+1 is prime

4*875^n+1 is now a 1ker with a weight of 1231

Results emailed - Base released

Sierp 928
 

Sierpinski 928 is complete to n=20K (hurrah!)

8 primes.

[CODE]13011*928^19341+1
15571*928^19516+1
1231*928^19879+1
27349*928^19055+1
24841*928^19179+1
26986*928^19569+1
25663*928^19928+1
24595*928^19966+1[/CODE]

Results emailed, continuing. (Not dead yet.)

R830 complete to n=25K. 13 k remain.
Base released.
Primes found and remaining k are attatched.

Reserving R998 to n=100k

S682 S862
 

Reserving S682 and S862 as new to n=25K

S583 S787
 

Reserving as new S583 and S787 to n=25K

Coming back
 

Reserving R1029 to n=250k, maybe higher.

S883
 

S883 tested n=33K-100K - Nothing found

Results emailed - Base released

R502 S502
 

Reserving R502 & S502 as new to n=25K

R988
 

R988 tested n-25K-100K - Nothing found

Results emailed - Base released

S618
 

Sierp Base 618
Conjectured k = 3995
Covering Set = 7, 37, 211
Trivial Factors k == 616 mod 617(617)

Found Primes: 3886k's - File emailed

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

Trivial Factor Eliminations: 6k's

MOB Eliminations: 2k's - File emailed

GFN's: 1k - File emailed
618

Base Released

R1025 tested to n=250k, nothing found. Going on to n=500k.

R995
 

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

Results emailed - Base released

S1001
 

S1001 tested n=40K-100K

110*1001^41547+1 is prime

46*1001^50860+1 is prime

Conjecture proven

Results emailed - Base released

ck of 166

S887
 

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

Results emailed - Base released

S787
 

Sierp Base 787
Conjectured k = 7684
Covering Set = 5, 7, 13, 19, 197
Trivial Factors k == 1 mod 2(2) and k == 2 mod 3(3) and k == 130 mod 131(131)

Found Primes: 2489k's - File emailed

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

Trivial Factor Eliminations: 1300k's

MOB Eliminations: 1k - File emailed
3148

Base Released

Reservations
 

Reserving as new S795 & S840 to n=25K