primal 0.2.0

A library to generate, identify and handle prime numbers and related properties. This library includes slow enumeration of primes up to a bound, slow factorisation of arbitrary numbers, fast primality tests 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).
Documentation
  • Feature flags
  • Feature flags are not available for this release because it was built before features were collected by docs.rs.

primal

There is very little structured metadata to build this page from currently. You should check the main library docs, readme, or Cargo.toml in case the author documented the features in them.

Feature flags are not available for this release because it was built before features were collected by docs.rs.