| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Factory.Math.Implementations.Primes.TrialDivision
Contents
Description
AUTHOR- Dr. Alistair Ward
DESCRIPTION- Generates the constant, conceptually infinite, list of prime-numbers, using Trial Division.
- trialDivision :: Integral prime => NPrimes -> [prime]
Functions
trialDivision :: Integral prime => NPrimes -> [prime] Source #
- For each candidate, confirm indivisibility, by all primes smaller than its square-root.
- The candidates to sieve, are generated by a
PrimeWheel, of parameterised, but static, size; https://en.wikipedia.org/wiki/Wheel_factorization.