Package primes provides simple functionality for working with prime numbers.
Call Sieve(n) to generate all prime numbers less than or equal to n,
IsPrime(n) to test for primality, Coprime(a,b) to test for coprimality,
and Pi(n) to count (or estimate) the number of primes less than or equal to n.
The algorithms used to implement the functions above are fairly simple; they work well with relatively small primes, but they are definitely not intended for work in cryptography or any application requiring really large primes. Run the benchmarks to check their performance against simpler baseline implementations.
See package documentation for full documentation and examples.
go get -u github.com/fxtlabs/primes
The MIT License (MIT). See the LICENSE file in this directory.