Like number theory, especially prime numbers, including: Finding large (probable) primes and factoring certain integers, both of the form (a*b^n+c)/gcd(a+c,b-1)
Pinned Loading
-
minimal-elements-of-the-prime-numbers
minimal-elements-of-the-prime-numbers PublicMinimal elements for the base b representations of the prime numbers > b for the subsequence ordering, for 2 ≤ b ≤ 36
C++ 1
-
Extended-Sierpinski-Riesel-conjectures
Extended-Sierpinski-Riesel-conjectures PublicFor 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.
-
-
-
Sierpinski-Riesel-for-fixed-k-and-variable-base
Sierpinski-Riesel-for-fixed-k-and-variable-base PublicThese are the status for all Sierpinski/Riesel bases 2<=b<=1024 for fixed k<=12. Search limit: 6000 for all (k,b) combo.
Something went wrong, please refresh the page to try again.
If the problem persists, check the GitHub status page or contact support.
If the problem persists, check the GitHub status page or contact support.