# NumberSieves: Number Theoretic Sieves: primes, factorization, and Euler's Totient

This package includes the Sieve of O'Neill and two generalizations of the Sieve of Eratosthenes. The Sieve of O'Neill is a fully incremental primality sieve based on priority queues. The other two are array based, and are not incremental. One sieves the smallest prime factor, and is useful if you want to factor a large quantity of small numbers. The other sieves Euler's Totient, which is the number of positive integers relatively prime and less than a given number.

## Downloads

- NumberSieves-0.1.2.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)

#### Maintainer's Corner

For package maintainers and hackage trustees

Candidates

- No Candidates

Versions [RSS] | 0.0, 0.1.1, 0.1.2 |
---|---|

Change log | CHANGES |

Dependencies | array (<1), base (>=3 && <5) [details] |

License | BSD-3-Clause |

Author | Melissa O'Neill, Leon P Smith |

Maintainer | Leon P Smith <leon@melding-monads.com> |

Category | Math |

Home page | http://patch-tag.com/r/lpsmith/NumberSieves |

Source repo | head: darcs get http://patch-tag.com/r/lpsmith/NumberSieves this: darcs get http://patch-tag.com/r/lpsmith/NumberSieves --tag 0.1.2 |

Uploaded | by LeonSmith at 2012-08-21T11:22:52Z |

Distributions | |

Reverse Dependencies | 1 direct, 0 indirect [details] |

Downloads | 3337 total (9 in the last 30 days) |

Rating | (no votes yet) [estimated by Bayesian average] |

Your Rating | |

Status | Docs uploaded by user Build status unknown [no reports yet] |