HaskellForMaths-0.4.8: Combinatorics, group theory, commutative algebra, non-commutative algebra

Safe Haskell | None
Language | Haskell98

Math.NumberTheory.Prime

Description

A module providing functions to test for primality, and find next and previous primes.

Synopsis

- primes :: [Integer]
- isTrialDivisionPrime :: Integer -> Bool
- isMillerRabinPrime :: (Integral a, Random a) => a -> Bool
- isPrime :: Integer -> Bool
- notPrime :: Integer -> Bool
- prevPrime :: Integer -> Integer
- nextPrime :: Integer -> Integer

# Documentation

primes :: [Integer] Source #

A (lazy) list of the primes

isTrialDivisionPrime :: Integer -> Bool Source #

isMillerRabinPrime :: (Integral a, Random a) => a -> Bool Source #

isPrime :: Integer -> Bool Source #

Is this number prime? The algorithm consists of using trial division to test for very small factors, followed if necessary by the Miller-Rabin probabilistic test.

notPrime :: Integer -> Bool Source #

prevPrime :: Integer -> Integer Source #

Given n, `prevPrime n` returns the greatest p, p < n, such that p is prime

nextPrime :: Integer -> Integer Source #

Given n, `nextPrime n` returns the least p, p > n, such that p is prime