++ed by:
DAVIDO AKRON ARISTOTLE ZMUGHAL MARIOROY

7 PAUSE users
1 non-PAUSE user.

Dana Jacobsen

Changes for version 0.52

  • ADDED
    • is_square_free(n) Check for repeated factors
  • FUNCTIONALITY AND PERFORMANCE
    • print_primes with 2 args was sending to wrong fileno.
    • Double speed of sum_primes.
    • Rewrote some internal sieve-walking code, speeds up next_prime, forprimes, print_primes, and more.
    • Small speedup for forcomposites / foroddcomposites.
    • Small speedup for is_prime with composite 32+ bit inputs.
    • is_frobenius_khashin_pseudoprime now uses Montgomery math for speed.
    • PrimeArray now treats skipping forward by relatively small amounts as forward iteration. This makes it much more efficient for many cases, but does open up some pathological cases.
    • PrimeArray now allows exporting @primes (and a few others), which saves some typing.
    • PrimeArray now works for indices up to 2^32-1, after which it silently rolls over. Previously it worked to 2^31-1 then croaked.
    • PrimeIterator now uses small segments instead of always next_prime. A little more memory, but 2-4x faster.
    • factor, divisor, fordivisors and some others should better keep bigint types (e.g. Math::GMPz input yields Math::GMPz output).
    • Faster GCD on some platforms.
    • Peter Dettman supplied a patch for Shawe-Taylor prime generation to make it deterministically match reference implementations. Thanks!
  • Misc
    • Check for old MPFR now using C library version, not module version.
    • prime_count_{lower,upper} now uses MPFR to give full precision.
    • Montgomery math and uint128_t enabled on Darwin/clang.

Documentation

Modules