Numeric.Euler.Primes

Documentation

isPrime :: Integral a => a -> Bool

The isPrime function checks whether a number a is prime by successively checking the remainder of the integer division with all numbers up to a-1.

trialAndDivision :: Int -> [Int]

The trialAndDivision function calculates prime numbers up to a certain limit by using the traditional (and very inneficient) trial and division method.

erastothenes :: Int -> [Int]

This is a naïve implementation of the Sieve of Erastothenes.

sundaram :: Int -> [Int]

An implementation of the Sieve of Sundaram.

atkin :: Int -> [(Int, Int)]

An implementation of the sieve of Atkin.