🚀 Fast prime number generator
Number theory: primes, arithmetic functions, modular computations, special sequences
A Java math library focused on number theory and integer factorization in particular.
🚀 Implementation of the Pseudosquares Prime Sieve algorithm capable of generating primes > 2^64
This is the repository which contains all Data Structures completely developed in C++
An extremely fast and efficient prime sieve
A Learning project in PITT MATH 1900 with Professor Hales
prime place for scripts of primes
Mapping the Quantum Way across Prime Identity
An attempt to optimise the search for prime.
Functions in Python doing prime stuff.
C library + CLI for prime enumeration at arbitrary scales!
GPU-accelerated elliptic curve cycle search over p = 2^255 - 19 using CUDA-parallel Cornacchia solving, Jacobi filtering, and full twist order
Prime number sieve written in Rust. Supports multithreading
Official repository for the Modular Projection Sieve: a sublinear Θ(√N/log N) memory algorithm based on Kmin± prime-coprime entanglement over (ℤ/6ℤ)ˣ. Features discrete spectral operator analysis (GOE quantum chaos), Lean 4 formal proofs, and reproducible Python/Numba execution up to N=10⁹.
CUDA (GPU) implementation of the sieve of Eratosthenes.
Lazy Sieve of Eratosthenes for infinitely generating primes lazily in Rust.
A prime number generator using the sieve of Eratosthenes. Created for Discrete Mathematics (MATH 221) course at Drexel University.
High-performance prime sieve supporting enumeration, primality testing, and nth-prime lookup up to 10¹⁸, with segmented sieve, Miller–Rabin, and OpenMP parallelism.
To associate your repository with the prime-sieve topic, visit your repo's landing page and select "manage topics."