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

[ bsd3, library, math ] [ Propose Tags ]
Versions 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 Tue Aug 21 11:22:52 UTC 2012
Distributions NixOS:0.1.2
Downloads 1728 total (13 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]
Hackage Matrix CI

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.




Maintainer's Corner

For package maintainers and hackage trustees