6 releases
| 0.3.3 | Jun 7, 2024 |
|---|---|
| 0.3.2 | Aug 15, 2022 |
| 0.3.1 | Jun 18, 2020 |
| 0.2.1 | Jun 8, 2015 |
#2990 in Math
22,047 downloads per month
Used in 98 crates
(3 directly)
21KB
251 lines
Estimate upper and lower bounds for the n-th prime, and π(n), the number of primes less than or equal to n.
This is designed to be used via the primal crate.
primal
primal puts raw power into prime numbers.
This crates includes
- optimised prime sieves
- checking for primality
- enumerating primes
- factorising numbers
- estimating upper and lower bounds for π(n) (the number of primes below n) and pk (the kth prime)
This uses a state-of-the-art cache-friendly Sieve of Eratosthenes to enumerate the primes up to some fixed bound (in a memory efficient manner), and then allows this cached information to be used for things like enumerating and counting primes.
primal takes around 2.8 seconds and less than 3MB of RAM to
count the exact number of primes below 1010 (455052511)
on the author's laptop (i7-3517U).