Changes for version 0.45 - 2014-09-26

  • ADDED
    • forcomb { ... } n, k combinations iterator
    • forperm { ... } n permutations iterator
    • factorial(n) n!
    • is_bpsw_prime(n) primality test with no pretests, just ES BPSW
    • is_frobenius_pseudoprime Frobenius quadratic primality test
    • is_perrin_pseudoprime Perrin primality test (unrestricted)
    • vecmin(@list) minimum of list of integers
    • vecmax(@list) maximum of list of integers
    • vecprod(@list) product of list of integers
    • bernfrac(n) (num,den) of Bernoulli number
    • bernreal(n) Bernoulli number as BigFloat
    • stirling(n,m,[type]) Stirling numbers of first or second kind
    • LambertW(k) Solves for W in k = W*exp(W)
    • Pi([digits]) Pi as NV or with requested digits
  • FUNCTIONALITY AND PERFORMANCE
    • znorder algorithm changed from Das to Cohen for ~1% speedup.
    • factoring sped up a bit for 15-19 digits.
    • speedup for divisor_sum with very large exponents.
  • OTHER
    • Alias added for the module name "ntheory". The module has grown enough that it seems more appropriate.
    • Big build change: Try a GMP compilation and add Math::Prime::Util::GMP to dependency list if it succeeds.
    • Fixed a memory leak in segment_primes / segment_twin_primes introduced in previous release. Thanks Valgrind!

Modules

Utilities related to prime numbers, including fast sieves and factoring
Elliptic curve operations for affine points
Elliptic curve operations for projective points
An auto-free object for Math::Prime::Util
Pure Perl version of Math::Prime::Util
PP front end for Math::Prime::Util
Primality proofs and certificates
A tied array for primes
An object iterator for primes
Generate random primes
Perl Big Float versions of Riemann Zeta and R functions
Number theory utilities