Safe Haskell	None
Language	Haskell2010

Factory.Math.Implementations.Primality

Contents

Description

Determines whether an integer is prime.
https://en.wikipedia.org/wiki/Primality_test.
http://primes.utm.edu/index.html
CAVEAT: it doesn't determine the prime-factors of composite numbers, just that they exist.

Synopsis

Types

Data-types

data Algorithm factorisationAlgorithm Source #

The algorithms by which primality-testing has been implemented.

Constructors

AKS factorisationAlgorithm	https://en.wikipedia.org/wiki/AKS_primality_test.
MillerRabin	https://en.wikipedia.org/wiki/Miller%E2%80%93Rabin_primality_test.

Instances

Eq factorisationAlgorithm => Eq (Algorithm factorisationAlgorithm) Source #
Methods (==) :: Algorithm factorisationAlgorithm -> Algorithm factorisationAlgorithm -> Bool # (/=) :: Algorithm factorisationAlgorithm -> Algorithm factorisationAlgorithm -> Bool #
Read factorisationAlgorithm => Read (Algorithm factorisationAlgorithm) Source #
Methods readsPrec :: Int -> ReadS (Algorithm factorisationAlgorithm) # readList :: ReadS [Algorithm factorisationAlgorithm] # readPrec :: ReadPrec (Algorithm factorisationAlgorithm) # readListPrec :: ReadPrec [Algorithm factorisationAlgorithm] #
Show factorisationAlgorithm => Show (Algorithm factorisationAlgorithm) Source #
Methods showsPrec :: Int -> Algorithm factorisationAlgorithm -> ShowS # show :: Algorithm factorisationAlgorithm -> String # showList :: [Algorithm factorisationAlgorithm] -> ShowS #
Default (Algorithm factorisationAlgorithm) Source #
Methods def :: Algorithm factorisationAlgorithm #
Algorithmic factorisationAlgorithm => Algorithmic (Algorithm factorisationAlgorithm) Source #
Methods isPrime :: (NFData i, Integral i, Show i) => Algorithm factorisationAlgorithm -> i -> Bool Source #