This is a small library for generating prime numbers. It doesn't follow any particularly well-known algorithm, but you might consider it to be a variation on the Sieve of Eratosthenes.
The F# module is 'org.contakt.math.prime.PrimeNumbers'. The key functions that it exports are:
- primesUpTo (nmax: int): int list - returns a list of the primes <= 'nmax'
- primes: int seq - returns an infinite sequence of the prime numbers (bounded in practice, though, by the amount of memory available)
- primeFactorsOf (n: int): (int*int) list - returns the prime factors of 'n' as a sequence of (factor,power) pairs.
Look at 'prime-number-examples.fsx' for examples of how to use the key functions.