primes
Computational number theory. Pure Python. Zero dependencies. Unreasonably fast.
Deterministic, exact prime computation with Meissel–Lehmer π(x). Reference implementation. Fire-and-forget.
A lightweight Python library providing number theory utilities including GCD, LCM, primes, modular arithmetic, and the Chinese Remainder Theorem.
Python library encapsulating the set of all primes as a generator (optimized for small primes).
A Python wrapper for primecount.
