Minimal elements for the base b representations of the prime numbers > b for the subsequence ordering, for 2 ≤ b ≤ 36

These are the status for all k<=1024 to all Sierpinski/Riesel bases 2 to 32 and bases 64, 128, 256. Search limit: 4096 for all (k,b) combo.

These are the status for all Sierpinski/Riesel bases 2<=b<=1024 for fixed k<=12. Search limit: 6000 for all (k,b) combo.

These are the status for the 1st, 2nd, 3rd, and 4th Sierpinski/Riesel conjectures to bases 2 to 64 (except 2, 3, 6, 15, 22, 24, 28, 30, 36, 40, 42, 46, 48, 52, 58, 60, 63 (which have larger conject…

For all bases 2<=b<=128 and b = 256, 512, 1024, finding and proving the smallest k>=1 such that (k*b^n+-1)/gcd(k+-1,b-1) (+ for Sierpinski, - for Riesel) is not prime for all integers n>=1.

These are PARI/GP programs.