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

Changes for version 0.69 - 2017-11-08

  • ADDED
    • is_totient(n) true if euler_phi(x) == n for some x
  • FUNCTIONALITY AND PERFORMANCE
    • is_square_free uses abs(n), like Pari and moebius.
    • is_primitive_root could be wrong with even n on some platforms.
    • euler_phi and moebius with negative range inputs weren't consistent.
    • factorialmod given a large n and m where m was a composite with large square factors was incorrect. Fixed.
    • numtoperm will accept negative k values (k is always mod n!)
    • Split XS mapping of many primality tests. Makes more sense and improves performance for some calls.
    • Split final test in PP cluster sieve.
    • Support some new Math::Prime::Util::GMP functions from 0.47.
    • C spigot Pi is 30-60% faster on x86_64 by using 32-bit types.
    • Reworked some factoring code.
    • Remove ISAAC (Perl and C) since we use ChaCha.
    • Each thread allocs a new const array again instead of sharing.

Modules

Math::Prime::Util
Utilities related to prime numbers, including fast sieves and factoring
Math::Prime::Util::ChaCha
Pure Perl ChaCha20 CSPRNG
Math::Prime::Util::ECAffinePoint
Elliptic curve operations for affine points
Math::Prime::Util::ECProjectivePoint
Elliptic curve operations for projective points
Math::Prime::Util::Entropy
Get a good random seed
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
ntheory
Number theory utilities

Examples

Other files