The Perl Toolchain Summit needs more sponsors. If your company depends on Perl, please support this very important event.

Changes for version 0.40 - 2014-04-21

  • ADDED
    • random_shawe_taylor_prime FIPS 186-4 random proven prime
    • random_shawe_taylor_prime_with_cert as above with certificate
    • twin_prime_count counts twin primes in range
    • twin_prime_count_approx fast approximation to Pi_2(n)
    • nth_twin_prime returns the nth twin prime
    • nth_twin_prime_approx estimates the nth twin prime
  • FUNCTIONALITY AND PERFORMANCE
    • Update PP Frobenius-Underwood test.
    • Speed up exp_mangoldt.
    • nth_prime_approx uses inverse RiemannR in XS code for better accuracy. Cippola 1902 is still used for PP and large values, with a slightly more accurate third order correction.
    • Tighten nth_prime_lower and nth_prime_upper for very small values.
    • Fix legendre_phi when given tiny x and large a (odd test case). Some speedups for huge a, from R. Andrew Ohana.
    • Ranged totient is slightly faster with start of 0.
    • Fix random_prime with a bigint prime high value.

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

Provides

in lib/Math/Prime/Util/PPFE.pm