Minimal elements for the base b representations of the prime numbers > b for the subsequence ordering, for 2 ≤ b ≤ 36
-
Updated
Jun 6, 2024 - C++
Minimal elements for the base b representations of the prime numbers > b for the subsequence ordering, for 2 ≤ b ≤ 36
Riecoin Core repository. Riecoin Whitepaper: https://riecoin.xyz/Whitepaper
🚀 Fast prime counting function implementations
🚀 Fast prime number generator
Number-theoretic conjecture related to primes congruent to 1 modulo 3. It is well known that if p is a prime such that p \equiv 1 \mod 3 and p^k divides a^2 + ab + b^2, then p^{2k+1} divides (a+b)^p - a^p - b^p. However, a conjecture posed by a reader of Kvant magazine suggests that there are no solutions for k > 2
Solutions to Project Euler problems
Search for binary sequences representing primes in multiple bases
Programs that checks whether a given integer is prime or not
Prime generator, used to compare different algorithms for generating prime numbers.
C++ basic codes & OOPS
Some examples of algorithms
Prime-related calculator for Windows and Sharp Brain series electronic dictionaries.
Fast small primes generator
OpenMP bit-level sieve of Eratosthenes
High-efficiency C++ divisibility-test prime factorizer
Add a description, image, and links to the prime-numbers topic page so that developers can more easily learn about it.
To associate your repository with the prime-numbers topic, visit your repo's landing page and select "manage topics."