-- Hoogle documentation, generated by Haddock
-- See Hoogle, http://www.haskell.org/hoogle/


-- | Mathematics utilities for Haskell
--   
@package euler
@version 0.7.0


module Numeric.Euler.Primes

-- | The <a>isPrime</a> function checks whether a number <tt>a</tt> is
--   prime by successively checking the remainder of the integer division
--   with all numbers up to <tt>a-1</tt>.
isPrime :: Integral a => a -> Bool

-- | The <a>trialAndDivision</a> function calculates prime numbers up to a
--   certain limit by using the traditional (and very inneficient) trial
--   and division method.
trialAndDivision :: Int -> [Int]

-- | This is a naïve implementation of the Sieve of Erastothenes.
erastothenes :: Int -> [Int]

-- | An implementation of the Sieve of Sundaram.
sundaram :: Int -> [Int]

-- | An implementation of the sieve of Atkin.
atkin :: Int -> [(Int, Int)]