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

[ bsd3, library, math ] [ Propose Tags ]

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 [RSS] [faq] 0.0, 0.1.1, 0.1.2
Change log CHANGES
Dependencies array (==0.*), base (>=3 && <5) [details]
License BSD-3-Clause
Author Melissa O'Neill, Leon P Smith
Maintainer Leon P Smith <>
Category Math
Home page
Source repo head: darcs get
this: darcs get --tag 0.1.2
Uploaded by LeonSmith at 2012-08-21T11:22:52Z
Distributions NixOS:0.1.2
Downloads 3030 total (9 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs uploaded by user
Build status unknown [no reports yet]




Maintainer's Corner

For package maintainers and hackage trustees