### 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 |

#**1728** in Math

**18,299** downloads per month

Used in **78** crates
(3 directly)

**MIT/Apache**

21KB

251 lines

# primal

puts raw power into prime numbers.`primal`

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*p*(the_{k}*k*th 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.

takes around 2.8 seconds and less than 3MB of RAM to
count the exact number of primes below 10`primal`^{10} (455052511)
on the author's laptop (i7-3517U).

###
`lib.rs`

:

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

crate.`primal`