Module: prime

This module provides prime number utilities.

Functions in this module:

Function	Short Description
(prime? n)	Check if number is a prime number
(nth-prime n)	Returns the nth prime
(prime-above n . limit)	Returns first prime above argument
(prime-below n)	Returns first prime less than argument
(factor n)	Returns factorization of argument
(perfect? n)	Returns true if argument is perfect number
(totient n)	Returns Euler totient
(aliquot n)	Returns the aliqout sum
(provable-prime? n)	Returns true if definitely prime
(probable-prime? n)	Returns true if probably prime
(random-prime lo hi)	Returns a random prime
(random-prime-distinct-from lo hi p)	Returns a random prime
(coprime? m n)	Returns true if arguments coprime
(random-coprime n)	Return a coprime number
(modular-inverse a b)	Returns inverse of the modulo
(modular-expt a e m)	Returns (remainder (expt a e) m)
(miller-rabin-composite? n)	Returns true if composite