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

Versions0.0, 0.1.1, 0.1.2
Dependenciesarray (==0.*), base (>=3 && <5)
LicenseBSD3
AuthorMelissa O'Neill, Leon P Smith
MaintainerLeon P Smith <leon@melding-monads.com>
CategoryMath
Home pagehttp://patch-tag.com/r/lpsmith/NumberSieves
Source repositoryhead: darcs get http://patch-tag.com/r/lpsmith/NumberSieves
this: darcs get http://patch-tag.com/r/lpsmith/NumberSieves --tag 0.1.2
Upload dateTue Aug 21 11:22:52 UTC 2012
Uploaded byLeonSmith
Downloads297 total (43 in last 30 days)

Modules

Downloads

Maintainers' corner

For package maintainers and hackage trustees