A Sierpinski/Riesel-like problem

[sweety439]

S115 and R105 are tested to n=8K, no other (probable) prime found, bases released.

Also, R118 k=43 is tested to n=8K, no (probable) prime found. base released.

[sweety439]

Reserve S6, using sr2sieve and pfgw. (I cannot reserve S3 with sr2sieve since sr2sieve cannot sieve the case which both b and k are odd)

[sweety439]

Originally Posted by sweety439

Sieve S10 k=269 to n=100K. (Unfortunately, I cannot sieve R43 k=13, because the cmd.exe says "ERROR: 13*43^n-1: every term is divisible by 2". For both sides (Sierpinski and Riesel), if and only if b and k are both odd, then srsieve cannot sieve it, thus srsieve can only sieve the case which b or k (or both) is even)

For S10 k=269, since the divisor (gcd(k+1,b-1)) is 9, and the only prime factor of 9 is 3, thus we do not sieve the prime 3, and all numbers of the form (269*10^n+1)/(269+1,10-1) are not divisible by 2 or 5, thus, we start with the prime 7. (of course, there are n's such that (269*10^n+1)/(269+1,10-1) is still divisible by 3, it is divisible by 3 if and only if n = 0 (mod 3), we should remove these n's from sieve file)

This is for the sr2sieve.

[sweety439]

S10 k=269 at n=91731, S36 k=1814 at n=81174, both no (probable) prime found.

[sweety439]

S10 k=269 tested to n=100K, no (probable) prime found, base released.

File attached.

S36 k=1814 is currently at n=87882, also no (probable) prime found.

[sweety439]

Originally Posted by sweety439

Reserve S6, using sr2sieve and pfgw. (I cannot reserve S3 with sr2sieve since sr2sieve cannot sieve the case which both b and k are odd)

Some (probable) primes are found for S6 (only sorted by n), I an now reserving this base to n=50K.

[sweety439]

Originally Posted by sweety439

Reserve S6, using sr2sieve and pfgw. (I cannot reserve S3 with sr2sieve since sr2sieve cannot sieve the case which both b and k are odd)

Update the sieve file.

[sweety439]

This file includes all S6 primes with n<=20K.

[sweety439]

Update the file for n <= 21001.

Continue to reserve...

[sweety439]

These are the conjectured smallest Sierpinski/Riesel numbers for bases 2<=b<=1024, searched up to k=10^6. (NA if this k > 10^6)

Note: only searched for exponent n<=1024 and for primes p<=30000.

[sweety439]

Originally Posted by sweety439

These are the conjectured smallest Sierpinski/Riesel numbers for bases 2<=b<=1024, searched up to k=10^6. (NA if this k > 10^6)

Note: only searched for exponent n<=1024 and for primes p<=30000.

Searched up to base 2048. (Also up to k=10^6)