11 results (0.037 seconds)
++ed by:
Dana Jacobsen
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
Math::Prime::Util in lib/Math/Prime/Util/PPFE.pm
Changes for version 0.42
    • gcdext(x,y) extended Euclidian algorithm
    • chinese([a,n],[a,n],...) Chinese Remainder
    • znlog is *much* faster. Added BSGS for XS and PP, Rho works better.
    • Another inverse improvement from W. Izykowski, doing 8 bits at a time. A further 1% to 15% speedup in primality testing.
    • A 35% reduction in overhead for forprimes with multicall.
    • prime segment sieving over large ranges will use larger segment sizes when given large bases. This uses some more memory, but is much faster.
    • An alternate method for calculating RiemannR used when appropriate.
    • RiemannZeta caps at 10M even with MPFR. This has over 300k leading 0s.
    • RiemannR will use the C code if not a BigFloat or without bignum loaded. The C code should only take a few microseconds for any value.
    • Refactor some PP code: {next,prev}_prime, chebyshev_{theta,psi}. In addition, PP sieving uses less memory.
    • Accelerate nth_twin_prime using the sparse twin_prime_count table.

Hosting generously
sponsored by Bytemark