slow_primes 0.1.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<sub>k</sub>* (the <i>k</i>th prime). 
[package]

name = "slow_primes"
version = "0.1.0"
authors = ["Huon Wilson <dbau.pp@gmail.com>"]

homepage = "https://github.com/huonw/slow_primes"
repository = "https://github.com/huonw/slow_primes"
documentation = "http://huonw.github.io/slow_primes/slow_primes/"
license = "MIT/APL2"
keywords = ["mathematics", "primes", "number-theory"]
readme = "README.md"
description = """
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<sub>k</sub>* (the <i>k</i>th
prime).
"""

[dependencies]
num = ">= 0.0.0"