### 6 releases

0.3.0 | Jun 18, 2020 |
---|---|

0.2.4 | Aug 22, 2017 |

0.2.3 | Aug 12, 2015 |

0.2.2 | Jun 9, 2015 |

#**3** in #number-theory

**2,949** downloads per month

Used in **45** crates
(2 directly)

**MIT/Apache**

19KB

478 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).

#### Dependencies

~18KB