/ 
Math-Prime-Util-0.40
River stage two • 13 direct dependents • 21 total dependents

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

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

Provides

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

Examples

Other files