| Safe Haskell | None |
|---|---|
| Language | Haskell98 |
Factory.Math.Implementations.Primes.Algorithm
Contents
Description
AUTHOR- Dr. Alistair Ward
DESCRIPTION
- Generates the constant list of prime-numbers, by a variety of different algorithms.
- http://www.haskell.org/haskellwiki/Prime_numbers.
- http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.31.3936&rep=rep1&type=pdf.
- http://larc.unt.edu/ian/pubs/sieve.pdf.
Types
Data-types
The implemented methods by which the primes may be generated.
Constructors
| SieveOfAtkin Integer | The Sieve of Atkin, optimised using a |
| SieveOfEratosthenes NPrimes | The Sieve of Eratosthenes (http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes), optimised using a |
| TrialDivision NPrimes | For each candidate, confirm indivisibility, by all primes smaller than its square-root, optimised using a |
| TurnersSieve | For each prime, the infinite list of candidates greater than its square, is filtered for indivisibility; http://www.haskell.org/haskellwiki/Prime_numbers#Turner.27s_sieve_-_Trial_division. |
| WheelSieve Int |