libmath-prime-util-perl (0.74-1) unstable; urgency=medium

  From upstream Changes:

    [API Changes]

    - is_pseudoprime, is_euler_pseudoprime, and is_strong_pseudoprime will
      use an implicit base of 2 rather than a missing base error.  This also
      means is_pseudoprime($n, @bases) works properly.

    - is_strong_pseudoprime passes for bases equal to 0 mod n.  This matches
      what the GMP code always did, and means primes return 1 for any base.

    - divisor_sum(0) returns 0.  divisors(0) returns an empty list.

    - divisors takes an optional second argument to prune the returned list.

    - consecutive_integer_lcm(0) was returning 0.  Now returns 1, matching
      the original GMP API as well as the OEIS series.

    - some error messages with invalid arguments have changed.

    - Callers must 'use Math::Prime::Util::MemFree;' if they want to use it.

    - bernfrac was documented to only accept non-negative inputs.  This is
      now enforced.

    - bernfrac and harmfrac return values are only bigints if needed.

    - The real functions no longer modify their behavior based on whether the
      "bignum" package was loaded, whether in scope or not.

 -- gregor herrmann <gregoa@debian.org>  Fri, 27 Mar 2026 23:30:30 +0100
