Factory.Math.Primes

AUTHOR

Dr. Alistair Ward

DESCRIPTION

Exports a common interface for implementations of prime-number generators.

Types-classes

class Algorithmic algorithm where

Defines the methods expected of a prime-number generator.

Methods

primes

Arguments

:: (NFData i, Ix i, Integral i)

=> algorithm

-> [i]

Returns the constant, infinite, list of primes.

Instances

Algorithmic Algorithm

Functions

primorial :: (Algorithmic algorithm, NFData i, Ix i, Integral i) => algorithm -> [i]

• Returns the constant list, defining the Primorial.
• http://en.wikipedia.org/wiki/Primorial.
• http://mathworld.wolfram.com/Primorial.html.

mersenneNumbers :: (Algorithmic algorithm, Integral i) => algorithm -> [i]

• Returns the constant ordered infinite list of Mersenne numbers.
• Only the subset composed from a prime exponent is returned; which is a strict superset of the Mersenne Primes.
• http://en.wikipedia.org/wiki/Mersenne_prime.
• http://mathworld.wolfram.com/MersenneNumber.html