# 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.

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

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

License | BSD-3-Clause |

Author | Melissa O'Neill, Leon P Smith |

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

Category | Number Theory, Algorithms |

Uploaded | by LeonSmith at Mon Jul 13 13:35:52 UTC 2009 |

Distributions | NixOS:0.1.2 |

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

Rating | (no votes yet) [estimated by rule of succession] |

Your Rating | |

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

## Modules

[Index]

## Downloads

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