++ed by:
NGLENN MARIOROY DAVIDO ARISTOTLE AKRON

7 PAUSE users

Dana Jacobsen

Modules

Provides

Changes for version 0.42

  • ADDED
    • gcdext(x,y) extended Euclidian algorithm
    • chinese([a,n],[a,n],...) Chinese Remainder
  • FUNCTIONALITY AND PERFORMANCE
    • 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.