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

Changes for version 0.35 - 2013-12-08

  • API Changes
    • We now use Math::BigInt in the module rather than dynamically loading it, and will switch to BigInts as needed. The most noticeable effect of this is that next_prime() / prev_prime() will switch between BigInt and native int at the boundary without regard to the input type or whether bigint is in effect, and next_prime will never return 0. Additionally, all functions will convert large decimal number strings to BigInts if needed.
      • $pref = primes("1000000000000000000000", "1000000000000000000999"); is_prime("882249208105452588824618008529"); $a = euler_phi("801294088771394680000412");
  • FUNCTIONALITY AND PERFORMANCE
    • Switched to extended LMO algorithm for prime_count. Much better memory use and much faster for large values. Speeds up nth_prime also. Huge thanks to Christian Bau's excellent paper and examples.
    • Some fixes for 32-bit.
    • prime_count_approx, upper, and lower return exact answers in more cases.
    • Fixed a problem with Lehmer prime_count introduced in 0.34.
    • nth_prime changed from RiemannR to inverse Li (with partial addition). This makes some of the big nth_prime calculations (e.g. 10^15, 10^16) run quite a bit faster as they sieve less on average.

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::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::ZetaBigFloat
Perl Big Float versions of Riemann Zeta and R functions

Examples

Other files