Package perl-Math-Prime-Util: Information

A set of utilities related to prime numbers.  These include multiple sieving.methods, is_prime, prime_count, nth_prime, approximations and bounds for
the prime_count and nth prime, next_prime and prev_prime, factoring utilities,
and more.

The default sieving and factoring are intended to be (and currently are)
the fastest on CPAN, including the Math::Prime::XS manpage, the Math::Prime::FastSieve manpage,
the Math::Factor::XS manpage, the Math::Prime::TiedArray manpage, the Math::Big::Factors manpage,
the Math::Factoring manpage, and the Math::Primality manpage (when the GMP module is available).
For numbers in the 10-20 digit range, it is often orders of magnitude faster.
Typically it is faster than the Math::Pari manpage for 64-bit operations.

All operations support both Perl UV's (32-bit or 64-bit) and bignums.  It
requires no external software for big number support, as there are Perl
implementations included that solely use Math::BigInt and Math::BigFloat.
If you want high performance with big numbers (larger than Perl's UV
size), you should install the Math::Prime::Util::GMP manpage.  This will be a
recurring theme throughout this documentation -- while all bignum operations
are supported in pure Perl, most methods will be much slower than the C+GMP
alternative.

The module is thread-safe and allows concurrency between Perl threads while
still sharing a prime cache.  It is not itself multi-threaded.  See the
Limitations section if you are using Win32 and threads in
your program.

Package perl-Math-Prime-Util: Information

Last changed