Pinned

1. minimal-elements-of-the-prime-numbers Public

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

   C++ 2

2. Extended-Sierpinski-Riesel-conjectures Public

   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.

   1

3. prime-programs-cached-copy Public

   C

4. pdf-files-cached-copy Public

5. non-single-digit-primes Public

6. Sierpinski-Riesel-for-fixed-k-and-variable-base Public

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

   1