[quote=mdettweiler;211034]Well, it's not so much a matter of confidence in the client/server application (LLRnet, PRPnet, etc.) as in making sure that there was no human error along the way. In almost all instances where I've found results missing from a range, it was due to a human slip-up, not a computer error, and sometimes this has pointed out significant problems in the process used by the person producing the results (Beyond's unstable machine that I caught in results processing comes to mind).

What will help a lot is when I finally get around to piecing together all my processing applications into one big program. The actual process is quite straightforward and rarely requires much non-automated interaction; the main hurdle to full automation is simply the matter of not having the time to code it up. :smile:

Also, at some point we'll hopefully have an NPLB-like stats DB set up for CRUS, which we can just dump all results into indiscriminately; the DB can handle sorting and categorizing the results without a problem, which would make it relatively easy to write code to check with the DB that certain conditions have been met (all tests below a prime on a given k have been tested, all results are present in a completed range, etc.) and then output the results in whatever format we want--LLR, PFGW, LLRnet, you name it.

In the meantime, though, I don't mind the extra work involved in making sure that everything's there. I agree that such precision is not needed for manual results, but for servers, there's many more variables involved and many more things that can go wrong--that's just the nature of their comparatively more complex setup. So therefore I'd rather spend an extra 5 minutes in processing than have, say, a whole range with conflicting duplicate results (a la Beyond's situation that I referenced earlier), or other such undesirable situations. :smile:

So, to sum up: in the future I'll be sure to combine non-primed and primed k's back into one results file at the end of processing to keep that consistent on your end. Never mind how much work it takes on my end to do that; just think of it as extra incentive for me to automate it further. :wink:[/quote]

OK, point taken. I know you like working with automating things so have fun with it. Yeah, human error is probably the biggest thing to be checking for when processing results coming from a personal server. They can be so complex to a person using them the first time that it's easy to miss something when setting up or loading them.

Thanks for the coding that you do. :smile:

[quote=rogue;211065]Would it be worth someone's time to compute the weight for each k in the single k conjecture thread? that would give users an idea as to how easy/difficult it might be to prove the conjecture.[/quote]

Yes, that would be VERY useful! Short of just sieving them to some nominal depth like P=100M, which would be a hassle, I'm not sure how it would be done. I'll put a posting there requesting such info. for people who know what program to run.

S755 and S776 k=8 conjectures proven and added to the pages.

Reserving Riesel 904 as new to n=25K

Riesel bases 902 and 965
 

Primes found:

2*902^4-1
3*902^3-1
4*902^1-1
5*902^4-1
6*902^2-1
7*902^3005-1

2*965^136-1
4*965^8755-1
6*965^10-1

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^n-1

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^6-1
3*632^4-1
4*632^5-1
5*632^2-1
6*632^2-1
7*632^1-1
8*632^4-1
9*632^19-1
10*632^5-1
11*632^14-1
12*632^1-1
13*632^15-1

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^4-1
3*740^3-1
4*740^3-1
5*740^1594-1
6*740^5-1
7*740^1-1
8*740^14-1
9*740^1-1
10*740^93-1
11*740^2-1
12*740^2-1
13*740^1-1

2*896^2-1
3*896^1-1
4*896^1-1
5*896^22-1
7*896^1-1
8*896^262-1
9*896^5-1
10*896^5-1
12*896^1386-1
13*896^11-1

The other k have trivial factors. With a conjectured k of 14, both of these are proven.