Safe Haskell | None |
---|

`AUTHOR`

- Dr. Alistair Ward
`DESCRIPTION`

- Determines whether an integer is prime.
- http://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.

- data Algorithm factorisationAlgorithm
- = AKS factorisationAlgorithm
- | MillerRabin

# Types

## Data-types

data Algorithm factorisationAlgorithm Source

The algorithms by which *primality*-testing has been implemented.

AKS factorisationAlgorithm | |

MillerRabin | http://en.wikipedia.org/wiki/Miller%E2%80%93Rabin_primality_test. |

Eq factorisationAlgorithm => Eq (Algorithm factorisationAlgorithm) | |

Read factorisationAlgorithm => Read (Algorithm factorisationAlgorithm) | |

Show factorisationAlgorithm => Show (Algorithm factorisationAlgorithm) | |

Defaultable (Algorithm factorisationAlgorithm) | |

Algorithmic factorisationAlgorithm => Algorithmic (Algorithm factorisationAlgorithm) |