`primal` puts raw power into prime numbers. This crates includes:
optimised prime sieves, checking for primality, enumerating primes,
factorising numbers, and state-of-the-art estimation of upper and lower
bounds for π(n) (the number of primes below n) and p_k (the k-th prime).
This package contains library source intended for building other packages which
use the "default" feature of the "primal" crate.
