Pinned Loading

1. minimal-elements-of-the-prime-numbersminimal-elements-of-the-prime-numbersPublic

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

   C++ 1

2. Extended-Sierpinski-Riesel-conjecturesExtended-Sierpinski-Riesel-conjecturesPublic

   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-copyprime-programs-cached-copyPublic

   C

4. pdf-files-cached-copypdf-files-cached-copyPublic

5. non-single-digit-primesnon-single-digit-primesPublic

6. Sierpinski-Riesel-for-fixed-k-and-variable-baseSierpinski-Riesel-for-fixed-k-and-variable-basePublic

   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