[QUOTE=henryzz;207428]If you don't want to spend time fiddling around proving these bases then I would be willing to load them into another personal prpnet server and set my clients to run 50/50. I could do with some variation in my prpnet testing plus i am still yet to find a prime with prpnet:sad:[/QUOTE]

Wow! You have obviously been very unlucky. Have you considered throwing a prime into your server just to know that the software is working correctly? :smile:

You must be working with some very stubborn k/b combos. I know that some of the entries in this thread ([url]http://www.mersenneforum.org/showthread.php?t=12980[/url]) have had a lot of work, but no success, but it doesn't appear that you are working on any of them.

[quote=henryzz;207428]If you don't want to spend time fiddling around proving these bases then I would be willing to load them into another personal prpnet server and set my clients to run 50/50. I could do with some variation in my prpnet testing plus i am still yet to find a prime with prpnet:sad:[/quote]
Feel free to take them if you like. :smile: FYI, just because I've mentioned that "I may come back to something" (which I do somewhat often) doesn't mean that I've got an exclusive hold on it--the way I see it, whoever gets the work done the quickest can have it.

[quote=rogue;207451]Wow! You have obviously been very unlucky. Have you considered throwing a prime into your server just to know that the software is working correctly? :smile:

You must be working with some very stubborn k/b combos. I know that some of the entries in this thread ([URL]http://www.mersenneforum.org/showthread.php?t=12980[/URL]) have had a lot of work, but no success, but it doesn't appear that you are working on any of them.[/quote]
The remaining k of riesel 173 from 25k-100k and so far 280 test on 56627*2^n-1 at n=~630k
all large tests
i dont count myself that unlucky

ok reserving:
S784: conjectured k 156, 3 k's remaining at 5K
S785: conjectured k 130, 2 k's remaining at 5K
S788: conjectured k 40, 5 k's remaining at 5K
Hopefully there are some primes here:smile:

[quote=henryzz;207469]The remaining k of riesel 173 from 25k-100k and so far 280 test on 56627*2^n-1 at n=~630k
all large tests
i dont count myself that unlucky

ok reserving:
S784: conjectured k 156, 3 k's remaining at 5K
S785: conjectured k 130, 2 k's remaining at 5K
S788: conjectured k 40, 5 k's remaining at 5K
Hopefully there are some primes here:smile:[/quote]
All ks tested to 10k no primes yet. Maybe i am unlucky.

[quote=henryzz;207497]All ks tested to 10k no primes yet. Maybe i am unlucky.[/quote]
finally 8*788^11407+1 is prime
the PRPs/ Primes column of server_stats.html wasn't updated although it is now listed as the lowest prime

[QUOTE=henryzz;207498]finally 8*788^11407+1 is prime
the PRPs/ Primes column of server_stats.html wasn't updated although it is now listed as the lowest prime[/QUOTE]

That is definitely a bug, which I have now fixed in the leading edge.

If you aren't afraid to edit the source, add these lines:
[code]
" PRPandPrimesFound = (select count(*) from Candidate " \
" where b = CandidateGroupStats.b " \
" and k = CandidateGroupStats.k " \
" and c = CandidateGroupStats.c " \
" and (IsPRP = 1 or IsPrime = 1)), " \
[/code]

to the select statement in SierpinskiRieselStatsUpdater::UpdateGroupStats. Insert these lines immediately before the setting of the SierpinskiRieselPrime column. Then use the admin tool to recompute server stats (after restarting the server with the new code) and you'll be good to go.

I won't be updating the web pages except sporadically until Monday or Tuesday. Most efforts will be reflected then.

[quote=mdettweiler;207411]S782: conjectured k 28, proven
S783: conjectured k 36, proven
S784: conjectured k 156, 3 k's remaining at 5K, not reserved
S785: conjectured k 130, 2 k's remaining at 5K, not reserved
S788: conjectured k 40, 5 k's remaining at 5K, not reserved

All requisite files for these are attached.[/quote]

Max, to put conjectured efforts on the pages, I've generally asked that people search them to at least n=10K. Otherwise it takes too long to update everything. Before starting any effort, can you please take that into account? Thanks.

I now see that David has searched them all to at least n=10K so I'll show them when I have time.


Gary

[quote=gd_barnes;207506]Max, to put conjectured efforts on the pages, I've generally asked that people search them to at least n=10K. Otherwise it takes too long to update everything. Before starting any effort, can you please take that into account? Thanks.

I now see that David has searched them all to at least n=10K so I'll show them when I have time.


Gary[/quote]
My search depth is continuously increasing fast. Currently i am at 12.7k and counting. Ask just before u do the webpages.

[quote=rogue;207336]I have finally finished this base to n=10000. This has been the most difficult base I've tackled.

Here is a summary. The conjectured k is 32514. This base has 19 MOB, 11048 are trivially factored, 20569 primes, and 834 k remaining.

I will continue this base a while longer, possibly as far as n=25000.

The difficulty in this base comes from two factors. First, the numbers take longer to test than a smaller base (such as base 58, which I completed a few weeks ago). Second, this base does not produce as many primes below n=10000. Most bases have < 1% of k remaining at n=10000. This base has a little more than 2.5% remaining.

Here is a question for Gary or anyone else in "the know". Which bases have the highest percent of remaining k at n=25000 where the conjuectured k > 100?[/quote]

Very good question and unknown. The higher the base, the more likely it is to have a higher percentage of k's remaining. So we'd have to break it up into bases <= 32, 33-100, 100-250, etc.

The problem with such a computation of all of the bases is that we would need to "normalize" them by calculating an estimated # of k's that would be remaining at n=25K or some other similar point. We also need to get a "starting point" of possible k's that are not already eliminated by trivial factors, MOBs, GFNs, or algebraic factors. The starting bases script should be able to mostly tell you the exact # of k's that a base starts with(sans algebraic factors). If you set max n to 0, it should show all possible k's remaining after dropping k's that don't need a prime.

It would take some effort but that would be something interesting. Tim, Mark, or other "numbers guys", would you like to take on such a task for bases <= 32? I suspect bases 19 and 30 will be up there on their "compositness".

I know one thing: Sierp 143 is extremely bad! For a conjecture of k=~7000-8000, it has 302 k's remaining at n=2500. I expect that it will have 180-200 k's remaining at n=25K. I've just now reserved it becaue (I think) it is the only base <= 200 with a conjecture < 10K that is still unsearched.


Gary

[QUOTE=gd_barnes;207509]I know one thing: Sierp 143 is extremely bad! For a conjecture of k=~7000-8000, it has 302 k's remaining at n=2500. I expect that it will have 180-200 k's remaining at n=25K. I've just now reserved it because (I think) it is the only base <= 200 with a conjecture < 10K that is still unsearched.[/QUOTE]

That is definitely worse than Riesel base 928. Even though the remaining percentage will be similar to mine, because it is an odd base, you had half as many k to test to begin with.