Changes for version 0.22 - 2018-02-17

  • ADDITIONS
    • is_smooth(n, k) :: returns a true value when all the prime factors of `n` are <= `k`
    • polymod(n, a, b, c, ...) :: computes the polymod of `n` against a list of numbers.
    • subfactorial(n,k) :: computes the number of derangements of a set with `n` elements with `k` fixed points.
    • multinomial(a, b, c, ...) :: computes the multinomial coefficient.
  • IMPROVEMENTS
    • Minor performance improvement in the `mod(n,k)` method when `k` fits into a native unsigned integer.
  • OTHER
    • Using the integer limits from Math::GMPq instead of POSIX. This makes POSIX no longer needed.

Modules

Arbitrary size precision for integers, rationals, floating-points and complex numbers.