Changelog for perl-Math-Prime-Util-0.66-1.1.x86_64.rpm :
Wed Sep 13 14:00:00 2017 cooloAATTsuse.com
- updated to 0.66
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes
0.66 2017-09-12
[ADDED]
- random_semiprime random n-bit semiprime (even split)
- random_unrestricted_semiprime random n-bit semiprime
- forderange { ... } n derangements iterator
- numtoperm(n,k) returns kth permutation of n elems
- permtonum([...]) returns rank of permutation array ref
- randperm(n[,k]) random permutation of n elements
- shuffle(...) random permutation of an array
[FUNCTIONALITY AND PERFORMANCE]
- Rewrite sieve marking based on Kim Walisch\'s new simple mod-30 sieve.
Similar in many ways to my old code, but this is simpler and faster.
- is_pseudoprime, is_euler_pseudoprime, is_strong_pseudoprime changed to
better handle the unusual case of base >= n.
- Speedup for is_carmichael.
- is_frobenius_underwood_pseudoprime checks for jacobi == 0. Faster.
- Updated Montgomery inverse from Robert Gerbicz.
- Tighter nth prime bounds for large inputs from Axler 2017-06.
Redo Ramanujan bounds since they\'re based on nth prime bounds.
- chinese objectifies result (i.e. big results are bigints).
- Internal support for Baillie-Wagstaff (pg 1402) extra Lucas tests.
- More standardized Lucas parameter selection. Like other tests and the
1980 paper, checks jacobi(D) in the loop, not gcd(D).
- entropy_bytes, srand, and csrand moved to XS.
- Add -secure import to disallow all manual seeding.

Tue Sep 12 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Mon Sep 11 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Sun Sep 10 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Sat Sep 9 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Fri Sep 8 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Thu Sep 7 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Wed Sep 6 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Tue Sep 5 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Mon Sep 4 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Sun Sep 3 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Sat Sep 2 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Fri Sep 1 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Thu Aug 31 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Wed Aug 30 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Tue Aug 29 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Mon Aug 28 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Sun Aug 27 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Sat Aug 26 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Fri Aug 25 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Thu Aug 24 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Wed Aug 23 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Tue Aug 22 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Mon Aug 21 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Sun Aug 20 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Sat Aug 19 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Fri Aug 18 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Wed Aug 16 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Tue Aug 15 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Mon Aug 14 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Sun Aug 13 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Sat Aug 12 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Fri Aug 11 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Thu Aug 10 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Wed Aug 9 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Tue Aug 8 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Mon Aug 7 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Sun Aug 6 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Sat Aug 5 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Fri Aug 4 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Thu Aug 3 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Wed Aug 2 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Tue Aug 1 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Mon Jul 31 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Sat Jul 29 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Fri Jul 28 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Thu Jul 27 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Wed Jul 26 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Tue Jul 25 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Mon Jul 24 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Sun Jul 23 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Sat Jul 22 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Fri Jul 21 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Wed Jul 19 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Mon Jul 17 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Sun Jul 16 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Sat Jul 15 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Fri Jul 14 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Thu Jul 13 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Wed Jul 12 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Tue Jul 11 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Mon Jul 10 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Sun Jul 9 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Sat Jul 8 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Fri Jul 7 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Thu Jul 6 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Wed Jul 5 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Tue Jul 4 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Mon Jul 3 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Sun Jul 2 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Sat Jul 1 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Fri Jun 30 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Thu Jun 29 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Wed Jun 28 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Tue Jun 27 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Mon Jun 26 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Sun Jun 25 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Sat Jun 24 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Fri Jun 23 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Thu Jun 22 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Wed Jun 21 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Tue Jun 20 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Mon Jun 19 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Sun Jun 18 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Sat Jun 17 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Fri Jun 16 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Thu Jun 15 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Wed Jun 14 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Fri Jun 9 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Fri Jun 2 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Thu Jun 1 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Wed May 31 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Tue May 30 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Mon May 29 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Sun May 28 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Sat May 27 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Fri May 26 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes

Thu May 25 14:00:00 2017 cooloAATTsuse.com
- updated to 0.65
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes
0.65 2017-05-03
[API Changes]
- Config options irand and primeinc are deprecated. They will carp if set.
[FUNCTIONALITY AND PERFORMANCE]
- Add Math::BigInt::Lite to list of known bigint objects.
- sum_primes fix for certain ranges with results near 2^64.
- is_prime, next_prime, prev_prime do a lock-free check for a find-in-cache
optimization. This is a big help on on some platforms with many threads.
- C versions of LogarithmicIntegral and inverse_li rewritten.
inverse_li honors the documentation promise within FP representation.
Thanks to Kim Walisch for motivation and discussion.
- Slightly faster XS nth_prime_approx.
- PP nth_prime_approx uses inverse_li past 1e12, which should run
at a reasonable speed now.
- Adjusted crossover points for segment vs. LMO interval prime_count.
- Slightly tighter prime_count_lower, nth_prime_upper, and Ramanujan bounds.
0.64 2017-04-17
[FUNCTIONALITY AND PERFORMANCE]
- inverse_li switched to Halley instead of binary search. Faster.
- Don\'t call pre-0.46 GMP backend directly for miller_rabin_random.
0.63 2017-04-16
[FUNCTIONALITY AND PERFORMANCE]
- Moved miller_rabin_random to separate interface.
Make catching of negative bases more explicit.
0.62 2017-04-16
[API Changes]
- The \'irand\' config option is removed, as we now use our own CSPRNG.
It can be seeded with csrand() or srand(). The latter is not exported.
- The \'primeinc\' config option is deprecated and will go away soon.
[ADDED]
- irand() Returns uniform random 32-bit integer
- irand64() Returns uniform random 64-bit integer
- drand([fmax]) Returns uniform random NV (floating point)
- urandomb(n) Returns uniform random integer less than 2^n
- urandomm(n) Returns uniform random integer in [0, n-1]
- random_bytes(nbytes) Return a string of CSPRNG bytes
- csrand(data) Seed the CSPRNG
- srand([UV]) Insecure seed for the CSPRNG (not exported)
- entropy_bytes(nbytes) Returns data from our entropy source
- :rand Exports srand, rand, irand, irand64
- nth_ramanujan_prime_upper(n) Upper limit of nth Ramanujan prime
- nth_ramanujan_prime_lower(n) Lower limit of nth Ramanujan prime
- nth_ramanujan_prime_approx(n) Approximate nth Ramanujan prime
- ramanujan_prime_count_upper(n) Upper limit of Ramanujan prime count
- ramanujan_prime_count_lower(n) Lower limit of Ramanujan prime count
- ramanujan_prime_count_approx(n) Approximate Ramanujan prime count
[FUNCTIONALITY AND PERFORMANCE]
- vecsum is faster when returning a bigint from native inputs (we
construct the 128-bit string in C, then call _to_bigint).
- Add a simple Legendre prime sum using uint128_t, which means only for
modern 64-bit compilers. It allows reasonably fast prime sums for
larger inputs, e.g. 10^12 in 10 seconds. Kim Walisch\'s primesum is
much more sophisticated and over 100x faster.
- is_pillai about 10x faster for composites.
- Much faster Ramanujan prime count and nth prime. These also now use
vastly less memory even with large inputs.
- small speed ups for cluster sieve.
- faster PP is_semiprime.
- Add prime option to forpart restrictions for all prime / non-prime.
- is_primitive_root needs two args, as documented.
- We do random seeding ourselves now, so remove dependency.
- Random primes functions moved to XS / GMP, 3-10x faster.
0.61 2017-03-12
[ADDED]
- is_semiprime(n) Returns 1 if n has exactly 2 prime factors
- is_pillai(p) Returns 0 or v wherev v! % n == n-1 and n % v != 1
- inverse_li(n) Integer inverse of Logarithmic Integral
[FUNCTIONALITY AND PERFORMANCE]
- is_power(-1,k) now returns true for odd k.
- RiemannZeta with GMP was not subtracting 1 from results > 9.
- PP Bernoulli algorithm changed to Seidel from Brent-Harvey. 2x speedup.
Math::BigNum is 10x faster, and our GMP code is 2000x faster.
- LambertW changes in C and PP. Much better initial approximation, and
switch iteration from Halley to Fritsch. 2 to 10x faster.
- Try to use GMP LambertW for bignums if it is available.
- Use Montgomery math in more places:
= sqrtmod. 1.2-1.7x faster.
= is_primitive_root. Up to 2x faster for some inputs.
= p-1 factoring stage 1.
- Tune AKS r/s selection above 32-bit.
- primes.pl uses twin_primes function for ~3x speedup.
- native chinese can handle some cases that used to overflow. Use Shell
sort on moduli to prevent pathological-but-reasonable test case.
- chinese directly to GMP
- Switch to Bytes::Random::Secure::Tiny -- fewer dependencies.
- PP nth_prime_approx has better MSE and uses inverse_li above 10^12.
- All random prime functions will use GMP versions if possible and
if a custom irand has not been configured.
They are much faster than the PP versions at smaller bit sizes.
- is_carmichael and is_pillai small speedups.
0.60 2016-10-09
[ADDED]
- vecfirstidx { expr } AATTn returns first index with expr true
[FUNCTIONALITY AND PERFORMANCE]
- Expanded and modified prime count sparse tables. Prime counts from 30k
to 90M are 1.2x to 2.5x faster. It has no appreciable effect on the
speed of prime counts larger than this size.
- fromdigits works with bigint first arg, no need to stringify.
Slightly faster for bigints, but slower than desired.
- Various speedups and changes for fromdigits, todigits, todigitstring.
- vecprod in PP for negative high-bit would return double not bigint.
- Lah numbers added as Stirling numbers of the third kind. They\'ve been
in the GMP code for almost 2 years now. Also for big results, directly
call the GMP code and objectify the result.
- Small performance change to AKS (r,s) selection tuning.
- On x86_64, use Montgomery math for Pollard/Brent Rho. This speeds up
factoring significantly for large native inputs (e.g. 10-20 digits).
- Use new GMP zeta and riemannr functions if possible, making some of
our operations much faster without Math::MPFR.
- print_primes with large args will try GMP sieve for big speedup. E.g.
use bigint; print_primes(2e19,2e19+1e7);
goes from 37 minutes to 7 seconds. This also removes a mistaken blank
line at the end for certain ranges.
- PP primes tries to use GMP. Only for calls from other PP code.
- Slightly more accuracy in native ExponentialIntegral.
- Slightly more accuracy in twin_prime_count_approx.
- nth_twin_prime_approx was incorrect over 1e10 and over 2e16 would
infinite loop due to Perl double conversion.
- nth_twin_prime_approx a little faster and more accurate.
0.59 2016-08-03
[ADDED]
- is_prime_power Returns k if n=p^k for p a prime.
- logint(n,b) Integer logarithm. Largest e s.t. b^e <= n.
- rootint(n,k) Integer k-th root.
- ramanujan_sum(k,n) Ramanujan\'s sum
[FUNCTIONALITY AND PERFORMANCE]
- Fixes for quadmath:
+ Fix \"infinity\" in t/11-primes.t.
+ Fix native Pi to use quads.
+ Trim some threading tests.
- Fix fromdigits memory error with large string.
- Remove 3 threading tests that were causing issues with Perl -DDEBUGGING.
- foroddcomposites with some odd start values could index incorrectly.
- is_primitive_root(1,0) returns 0 instead of fp exception.
- mertens() uses a little less memory.
- 2x speedup for znlog with bigint values.
- is_pseudoprime() and is_euler_pseudoprime() use Montgomery math so are
much faster. They seem to be ~5% faster than Miller-Rabin now.
- is_catalan_pseudoprime 1.1x to 1.4x faster.
- is_perrin_pseudoprime over 10x faster.
Uses Adams/Shanks doubling and Montgomery math.
Single core, odd composites: ~8M range/s.
- Add restricted Perrin pseudoprimes using an optional argument.
- Add bloom filters to reject non-perfect cubes, fifths, and sevenths.
is_power about 2-3x faster for native inputs.
- forcomposites / foroddcomposites about 1.2x faster past 64-bit.
- exp_mangoldt rewritten to use is_prime_power.
- Integer root code rewritten and now exported.
- We\'ve been hacking around the problem of older Perls autovivifying
functions at compile time. This makes functions that don\'t exist
return true when asked if they\'re defined, which causes us distress.
Store the available GMP functions before loading the PP code.
XS code knows MPU::GMP version and calls as appropriate. This works
around the auto-vivication, and lets us choose to call the GMP
function based on version instead of just existence.
E.g. GMP\'s is_power was added in 0.19, but didn\'t support negative
powers until 0.28.

Mon Jun 13 14:00:00 2016 cooloAATTsuse.com
- updated to 0.58
see /usr/share/doc/packages/perl-Math-Prime-Util/Changes
0.58 2016-05-21
[API Changes]
- prev_prime($n) where $n <= 2 now returns undef instead of 0. This
may enable catching range errors, and is technically more correct.
- nth_prime(0) now returns undef instead of 0. This should help catch
cases where the base wasn\'t understood. The change is similar for
all the nth_
* functions (e.g. nth_twin_prime).
- sumdigits(n,base) will interpret n as a number in the given base,
rather than the Pari/GP method of converting decimal n to that base
then summing. This allows sumdigits to easily sum hex strings.
The old behavior is easily done with vecsum(todigits(n, base)).
- binary() was not intended to be released (todigits and todigitstring
are supersets), but the documentation got left in. Remove docs.
[ADDED]
- addmod(a, b, n) a + b mod n
- mulmod(a, b, n) a
* b mod n
- divmod(a, b, n) a / b mod n
- powmod(a, b, n) a ^ b mod n
- sqrtmod(a, n) modular square root
- is_euler_pseudoprime(n,a[...]) Euler test to given bases
- is_primitive_root(r, n) is r a primitive root mod n
- is_quasi_carmichael(n) is n a Quasi-Carmichael number
- hclassno(n) Hurwitz class number H(n)
* 12
- sieve_range(n, width, depth) sieve to given depth, return offsets
[FUNCTIONALITY AND PERFORMANCE]
- Fixed incorrect table entries for 2^16th Ramanujan prime count and
nth_ramanujan_prime(23744).
- foroddcomposites with certain arguments would start with 10 instead of 9.
- lucasu and lucasv should return bigint types.
- vecsum will handle 128-bit sums internally (performance increase).
- Speedup is_carmichael.
- Speedup znprimroot, 10% for small inputs, 10x for large composites.
- Speedup znlog ~2x. It is now Rho racing an interleaved BSGS.
- Change AKS to Bernstein 2003 theorem 4.1.
5-20x faster than Bornemann, 20000+x faster than V6.
- sum_primes now uses tables for native sizes (performance increase).
- ramanujan_tau uses Cohen\'s hclassno method instead of the sigma
calculation. This is 3-4x faster than the GMP code for inputs > 300k,
and much faster than the older PP code.
- fromdigits much faster for large base-10 arrays. Timing is better than
split plus join when output is a bigint.
0.57 2016-01-03
[ADDED]
- formultiperm { ... } \\AATTn loop over multiset permutations
- todigits(n[,base[,len]]) convert n to digit array
- todigitstring(n[,base[,len]]) convert n to string
- fromdigits(\\AATTd[,base]) convert digit array ref to number
- fromdigits(str[,base]) convert string to number
- ramanujan_prime_count counts Ramanujan primes in range
- vecany { expr } AATTn true if any expr is true
- vecall { expr } AATTn true if all expr are true
- vecnone { expr } AATTn true if no expr are true
- vecnotall { expr } AATTn true if not all expr are true
- vecfirst { expr } AATTn returns first element with expr true
[FUNCTIONALITY AND PERFORMANCE]
- nth_ramanujan_prime(997) was wrong. Fixed.
- Tighten Ramanujan prime bounds. Big speedups for large nth Rp.
0.56 2015-12-13
[ADDED]
- is_carmichael(n) Returns 1 if n is a Carmichael number
- forcomp { ... } n[,{...}] loop over compositions
[FUNCTIONALITY AND PERFORMANCE]
- Faster, nonrecursive divisors_from_factors routine.
- gcdext(0,0) returns (0,0,0) to match GMP and Pari/GP.
- Use better prime count lower/upper bounds from Büthe 2015.
- forpart and forcomp both use lexicographic order (was anti-lexico).
0.55 2015-10-19
- Fixed test that was using a 64-bit number on 32-bit machines.
[FUNCTIONALITY AND PERFORMANCE]
- Speed up PP versions of sieve_prime_cluster, twin_primes,
twin_prime_count, nth_twin_prime, primes.
0.54 2015-10-14
[ADDED]
- sieve_prime_cluster(low,high[,...]) find prime clusters
[Misc]
- Certain small primes used to return false with Frobenius and AES Lucas
tests when given extra arguments. Both are unusual cases never used
by the main system. Fixed.
0.53 2015-09-05
[ADDED]
- ramanujan_tau(n) Ramanujan\'s Tau function
- sumdigits(n[,base]) sum digits of n
[FUNCTIONALITY AND PERFORMANCE]
- Don\'t use Math::MPFR unless underlying MPFR library is at least 3.x.
- Use new Math::Prime::Util::GMP::sigma function for divisor_sum.
- Use new Math::Prime::Util::GMP::sieve_twin_primes(a,b).

Sun Sep 20 14:00:00 2015 cooloAATTsuse.com
- initial package 0.52

* created by cpanspec 1.78.08