File: Counting.hs

package info (click to toggle)
haskell-arithmoi 0.13.0.0-1
  • links: PTS
  • area: main
  • in suites: forky, sid, trixie
  • size: 988 kB
  • sloc: haskell: 10,437; makefile: 5
file content (22 lines) | stat: -rw-r--r-- 701 bytes parent folder | download 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
 
-- |
-- Module:      Math.NumberTheory.Primes.Counting
-- Copyright:   (c) 2011 Daniel Fischer
-- Licence:     MIT
-- Maintainer:  Daniel Fischer <daniel.is.fischer@googlemail.com>
--
-- Number of primes not exceeding @n@, @&#960;(n)@, and @n@-th prime; also fast, but
-- reasonably accurate approximations to these.
module Math.NumberTheory.Primes.Counting
    ( -- * Exact functions
      primeCount
    , primeCountMaxArg
    , nthPrime
      -- * Approximations
    , approxPrimeCount
    , approxPrimeCountOverestimateLimit
    , nthPrimeApprox
    , nthPrimeApproxUnderestimateLimit
    ) where

import Math.NumberTheory.Primes.Counting.Impl
import Math.NumberTheory.Primes.Counting.Approximate