Update the word file for the newest status for bases b<=32.

(9*63^2162+1)/2 is (probable) prime!!!

Update the word file for the status for all bases b<=64.

[QUOTE=sweety439;458433]Can you reserve these problems (extended Sierpinski/Riesel problems)? Especially S3, S10, S25 and R7. The word file already give the list of the remain k's.[/QUOTE]

Frankly I don't even understand these particular conjectures and how to search them. I've read the first post here and it still does not make sense. You would have to explain it to me in plain words...no math jargon.

Regardless, the main reason that I'm not insterested is that the word file cannot be updated in real time like a web page can. I will not reserve and search anything until you create a web page that you are continously updating and provide a link to it in the first posting here.

Some of these efforts are somewhat interesting. That is why I have done some searching and also Karsten (kar_bon) did some searching too. In order for you to get people to consistently search for you, you will have to learn how to create web pages and also how to use the correct software so that you can explain that software to people. It is not hard. When I started CRUS nearly 10 years ago I knew nothing about creating web pages and I only knew a little about the software that needed to be used for searching. Basically it just came down to me asking people how it is done and really listening when they explained it to me. Learning those things is part of being the administrator of a project.

To show you how a page could look like, I've created one at [url='http://www.mersennewiki.org/index.php/Sierpinski_problem_%28extended_definition%29']MersenneWiki[/url].

The table contains the values of your word files. The second display for base=3 is more easier to look at, especially if the columns 4/6 are filled with some data from other bases: the contents of those columns are too large to display all in such table with columns.

There's not much text at all: the definitions and some links are given (I've also created the page for CRUS there).

Other options:
- every base make their own sub-page -> links to forum-posts for history
- date of last edit of a base included in table
- reservations / completions marked like [url='http://www.mersennewiki.org/index.php/Aliquot_Sequences_Search']here[/url]

So, get an account at MersenneWiki (see [url='http://www.mersenneforum.org/forumdisplay.php?f=57']here[/url]), see the source of some pages, read [url='https://www.mediawiki.org/wiki/Help:Contents']how to edit pages[/url] and update/extend those pages instead posting every few days new doc-files.

BTW the MW page for [URL="http://www.mersennewiki.org/index.php/Sierpinski_problem#The_hopes_for_a_proof"]S-problem[/URL] is very old - it only mentions SoB with 9 primes found, 8 remaining (it should be 12 - together with PrimeGrid - and respective 5 remaining). Also, no mention to the "real" extended problem, or the "prime" one, of finding the first S-number which is prime.

(edit: we had an account, but forgot the password :sad:, however it should be stored in our computer at home)

I've just updated the page [url='http://www.mersennewiki.org/index.php/Sierpinski_problem']Sierpinski problem[/url] at mersennewik, older finds from SoB not yet included.

Much work to do, needing more editors.

Nice. Love the table, much better than the long and ugly list before. I did an edit today on the wiki page (the main one, not the mersenne one) to clear some confusion about the prime-S problem and to mention the extended-S problem.

Currently there are 32 extended Sierpinski problems (with bases b<=64) and 41 extended Riesel problems (with bases b<=64) that are proven (in the weak case that probable primes can be considered as defined primes)

The proven Sierpinski problems are:

4, 5, 7, 8, 9, 11, 13, 14, 16, 17, 19, 20, 21, 23, 27, 29, 34, 35, 39, 41, 43, 44, 45, 47, 49, 51, 54, 56, 57, 59, 61*, 64*.

The proven Riesel problems are:

4, 5, 8, 9, 10, 11, 12, 13, 14, 16, 17*, 18, 19, 20, 21, 23, 25, 26, 27, 29, 32, 34, 35, 37, 38, 39, 41, 44, 45, 47, 49, 50, 51*, 53, 54, 55, 56, 57, 59, 62, 64.

* In these bases some of the primes found are probable primes that have not been certified.

The non-certified probable primes for these bases are:

S61:

(62*61^3698+1)/3
(43*61^2788+1)/4

S64:

(11*64^3222+1)/3

R17:

(29*17^4904-1)/4

R51:

(1*51^4229-1)/50

[QUOTE=kar_bon;458625]I've just updated the page [URL="http://www.mersennewiki.org/index.php/Sierpinski_problem"]Sierpinski problem[/URL] at mersennewik, older finds from SoB not yet included.

Much work to do, needing more editors.[/QUOTE]

kar_bon, did you find any (probable) prime for these bases?

[CODE]
base remain k n testing limit
S10 269 24K
S25 71 10K
S33 67, 203, 407 6K
S36 1814 6K
R7 197 29K
R33 257, 339 6K
R43 13 5K
R61 37, 53, 100 4K
[/CODE]