[QUOTE=sweety439;458700]This divisor is always gcd(k+-1,b-1) (+ for Sierpinski, - for Riesel), e.g. for R7, k=197, the divisor is gcd(197-1,7-1) = 2, and for S10, k=269, the divisor is gcd(269+1,10-1) = 9. Besides, for SR3, the divisor of all even k is 1 and the divisor of all odd k is 2.

Thus, for example, for R13, the divisor of k=1, 2, 3, ... are {12, 1, 2, 3, 4, 1, 6, 1, 4, 3, 2, 1, 12, 1, 2, 3, 4, 1, ...}, and for S11, the divisor of k=1, 2, 3, ... are {2, 1, 2, 5, 2, 1, 2, 1, 10, 1, 2, 1, 2, 5, 2, 1, 2, 1, ...}.[/QUOTE]

OK I understand it now. But wow...these forms are a pain-in-the-arse to search and sieve. Each base has a rotating set of divisors for its k's. So it would have to have multiple and separate sieves done...whereas CRUS and the repeating digit effort that I did a lot of searching on here could be sieved and tested one time for each base/digit combo.

With this much personal effort required to search a single base I doubt that you will have too many interested people. But...it's all in the presentation. You have to create that web page and demonstrate that you can run the correct programs before asking others to do the same. If you do that you may get some more interested people.

Fixed the "top 10 primes" column for R3, the 10th largest known (probable) prime for R3 should be (7379*3^16856-1)/2, not (8753*3^16533-1)/2 (it is the 11th largest known (probable) prime).

[QUOTE=gd_barnes;458775]No I cannot. As I stated before I will not run these forms until you create a web page that shows all ongoing search depths, statuses, and reservations in one place that can be updated instantly. Furthermore as the administrator of your own project here, you must learn how to run srsieve, LLR, and PFGW. When you create the web page and can demonstrate that you know how to run srsieve then I will consider helping out and sending you some of CRUS's primes that you need.

As I stated in the last post, I think the problem is that you have never run a program from the command prompt. Srsieve, sr1sieve, and sr2sieve must be run from the command prompt. There is some good news for you though: PFGW and LLR have a nice Windows GUI and do not have to be run at the command prompt although I believe they are slightly quicker when run from the command prompt.[/QUOTE]

No, I don't know how to create a web page.

Deleted unnecessary forms in the "k's that make a full covering set with all or partial algebraic factors" column.

[QUOTE=sweety439;458790]No, I don't know how to create a web page.[/QUOTE]

I gave you the [url='http://www.mersennewiki.org/index.php/Sierpinski_problem_%28extended_definition%29']ability[/url] to do so, even with some better display of all data and state of work for the bases.

[QUOTE=kar_bon;458829]I gave you the [URL="http://www.mersennewiki.org/index.php/Sierpinski_problem_%28extended_definition%29"]ability[/URL] to do so, even with some better display of all data and state of work for the bases.[/QUOTE]

Well, I requested an account for mersennewiki in [URL]http://mersenneforum.org/showthread.php?t=7026&page=15[/URL].

Fixed a type error (there was an extra comma in the text file before).

[QUOTE=kar_bon;458829]I gave you the [URL="http://www.mersennewiki.org/index.php/Sierpinski_problem_%28extended_definition%29"]ability[/URL] to do so, even with some better display of all data and state of work for the bases.[/QUOTE]

I have posted the extended Sierpinski problem and the extended Riesel problem at [URL]http://www.mersennewiki.org/index.php/Sierpinski_problem_%28extended_definition%29[/URL] and [URL]http://www.mersennewiki.org/index.php/Riesel_problem_%28extended_definition%29[/URL].

Ok, now the next steps. Insert the other bases and results.

I would prefer the alternate view: if conditions and/or comments are given, the table entries are broadens too much (see Riesel base 12).

Note to remaining lists (see Sierp base 6):
create subpages to "Sierpinski problem (extended definition)" like "Sierpinski problem (extended definition)/base 6" because the phrase "Extended Sierpinski" is used for another project.

Don't forget to categorize new pages (see "Riesel problem (extended definition)").

For OEIS-sequences in "Repunit" there's a template, see "Template:OEIS".

And here's a new result: Riesel base 7 (extended), k-val = 197
(197*7^181761-1)/2 is PRP, 153608 digits

pfgw -q"(197*7^181761-1)/2"
PFGW Version 3.3.6.20100908.Win_Stable [GWNUM 25.14]
(197*7^181761-1)/2 is 3-PRP!

pfgw -tp -q"(197*7^181761-1)/2"
PFGW Version 3.3.6.20100908.Win_Stable [GWNUM 25.14]
Primality testing (197*7^181761-1)/2 [N+1, Brillhart-Lehmer-Selfridge]
Running N+1 test using discriminant 3, base 3+sqrt(3)
Calling Brillhart-Lehmer-Selfridge with factored part 0.01%
(197*7^181761-1)/2 is Lucas PRP!

[QUOTE=kar_bon;459155]Ok, now the next steps. Insert the other bases and results.

I would prefer the alternate view: if conditions and/or comments are given, the table entries are broadens too much (see Riesel base 12).

Note to remaining lists (see Sierp base 6):
create subpages to "Sierpinski problem (extended definition)" like "Sierpinski problem (extended definition)/base 6" because the phrase "Extended Sierpinski" is used for another project.

Don't forget to categorize new pages (see "Riesel problem (extended definition)").

For OEIS-sequences in "Repunit" there's a template, see "Template:OEIS".

And here's a new result: Riesel base 7 (extended), k-val = 197
(197*7^181761-1)/2 is PRP, 153608 digits

pfgw -q"(197*7^181761-1)/2"
PFGW Version 3.3.6.20100908.Win_Stable [GWNUM 25.14]
(197*7^181761-1)/2 is 3-PRP!

pfgw -tp -q"(197*7^181761-1)/2"
PFGW Version 3.3.6.20100908.Win_Stable [GWNUM 25.14]
Primality testing (197*7^181761-1)/2 [N+1, Brillhart-Lehmer-Selfridge]
Running N+1 test using discriminant 3, base 3+sqrt(3)
Calling Brillhart-Lehmer-Selfridge with factored part 0.01%
(197*7^181761-1)/2 is Lucas PRP![/QUOTE]

Great!!! What about S10, k=269?

[QUOTE=kar_bon;459155]Ok, now the next steps. Insert the other bases and results.

I would prefer the alternate view: if conditions and/or comments are given, the table entries are broadens too much (see Riesel base 12).

Note to remaining lists (see Sierp base 6):
create subpages to "Sierpinski problem (extended definition)" like "Sierpinski problem (extended definition)/base 6" because the phrase "Extended Sierpinski" is used for another project.

Don't forget to categorize new pages (see "Riesel problem (extended definition)").

For OEIS-sequences in "Repunit" there's a template, see "Template:OEIS".

And here's a new result: Riesel base 7 (extended), k-val = 197
(197*7^181761-1)/2 is PRP, 153608 digits

pfgw -q"(197*7^181761-1)/2"
PFGW Version 3.3.6.20100908.Win_Stable [GWNUM 25.14]
(197*7^181761-1)/2 is 3-PRP!

pfgw -tp -q"(197*7^181761-1)/2"
PFGW Version 3.3.6.20100908.Win_Stable [GWNUM 25.14]
Primality testing (197*7^181761-1)/2 [N+1, Brillhart-Lehmer-Selfridge]
Running N+1 test using discriminant 3, base 3+sqrt(3)
Calling Brillhart-Lehmer-Selfridge with factored part 0.01%
(197*7^181761-1)/2 is Lucas PRP![/QUOTE]

You can submit this PRP in [URL]http://www.primenumbers.net/prptop/prptop.php[/URL], also the PRP you found for R30, k=1654: (1654*30^38869-1)/29.