Hello.

Would there be interest in a very basic discrete math SRFI? I suppose
that a library covering these would be nice:

- factorial
- probably-prime?
- next-prime (a prime generator?)
- extended-gcd (or "bezout", or whatever name seems better)
- invert/mod
- expt/mod
- +/mod -/mod */mod div/mod

Maybe, but not sure:

- certainly-prime? (strange name, but may make sense given the question
mark standard way in Scheme)
- factor
- binomial
- divisors
- fibonacci, lucas (these seem unnecessary for a basic API)

Maybe start with something very basic instead of a full-fledged number
theory or combinatorics API, and maybe propose another SRFI later?

J.