Prime and number theoretic utilities. Returns a pair whose car is the power of 2 in the factorization of n, and whose cdr is the product of all remaining primes.
n is definitely prime. May take an
impossibly long time for large values.
n to be composite by finding an
exception to the Miller Rabin lemma.
n has a very high probability (enough that
you can assume a false positive will never occur in your lifetime)
of being prime.
n is prime. Uses
n, falling back on
n, or #f if
there are no such primes.
n. If the
limit is given and not false, returns
if no such primes exist below
n as a monotonically
increasing list of primes.
n that are relatively prime to
n is a perfect number, i.e. the sum of its
divisors other than itself equals itself.
lo, inclusive, and
random-prime which ensures the result is
n relatively prime to