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>
CategoryNumber Theory, Algorithms
Upload dateMon Jul 13 13:35:52 UTC 2009
Uploaded byLeonSmith
Downloads402 total (41 in last 30 days)

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees