THIRD-PARTY CRATE

slow_primes

Deprecated in favour of `primal`. 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).

Current version0.1.14

LicenseMIT/Apache-2.0

Total downloads426,831

Last updated2015-12-11

Homepagehttps://github.com/huonw/slow_primes

Repositoryhttps://github.com/huonw/slow_primes

Documentationhttp://huonw.github.io/slow_primes/slow_primes/

Keywords

View slow_primes on crates.io →

RustDocs Hub renders this crate’s structured metadata only (name, description, downloads, version, license string, links, categories, keywords) per crates.io’s Data Access Policy. It does not re-host this crate’s README or source code — view the full README and source on crates.io or the repository link above.

Data as of 2026-07-25 (crates.io database dump, timestamp 2026-07-25T02:00:36Z). Source: crates.io · db-dump.tar.gz · methodology & corrections.