The NumberSieves package

[Tags:bsd3, library]

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.

Properties

Versions 0.0, 0.1.1, 0.1.2
Change log CHANGES
Dependencies array (==0.*), base (>=3 && <5) [details]
License BSD3
Author Melissa O'Neill, Leon P Smith
Maintainer Leon P Smith <leon@melding-monads.com>
Stability Unknown
Category Math
Home page http://patch-tag.com/r/lpsmith/NumberSieves
Source repository 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 Tue Aug 21 11:22:52 UTC 2012 by LeonSmith
Distributions NixOS:0.1.2
Downloads 1087 total (10 in the last 30 days)
Votes
0 []
Status Docs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees