Number theory: primes, arithmetic functions, modular computations, special sequences
A Java math library focused on number theory and integer factorization in particular.
This is the repository which contains all Data Structures completely developed in C++
Mapping the Quantum Way across Prime Identity
Functions in Python doing prime stuff.
An attempt to optimise the search for prime.
A prime number generator using the sieve of Eratosthenes.
Lazy Sieve of Eratosthenes for infinitely generating primes lazily in Rust.
Prime number sieve written in Rust. Supports multithreading
prime place for scripts of primes
Sieve of Eratosthenes and Sieve of Atkin implemented in Python, and made fast using Numba and Numpy.
rust implementation of window sieve a windowed prime sieve.
Code to Questions
A somewhat fast C++ implementation of a prime sieve.
Prime sieve impementation.
A sieve of Eratosthenes implemented in x86-64 assembly
My solutions to some Project Euler problems. Emphasis on elegance (where possible) and performance.
Add a description, image, and links to the prime-sieve topic page so that developers can more easily learn about it.
To associate your repository with the prime-sieve topic, visit your repo's landing page and select "manage topics."