Source: libmath-prime-util-perl Maintainer: Debian Perl Group Uploaders: gregor herrmann , Salvatore Bonaccorso Section: perl Testsuite: autopkgtest-pkg-perl Priority: optional Build-Depends: debhelper (>= 10), help2man, libmath-prime-util-gmp-perl (>= 0.50), libtest-warn-perl, perl Standards-Version: 4.2.1 Vcs-Browser: https://salsa.debian.org/perl-team/modules/packages/libmath-prime-util-perl Vcs-Git: https://salsa.debian.org/perl-team/modules/packages/libmath-prime-util-perl.git Homepage: https://metacpan.org/release/Math-Prime-Util Package: libmath-prime-util-perl Architecture: any Depends: libmath-prime-util-gmp-perl (>= 0.50), ${misc:Depends}, ${perl:Depends}, ${shlibs:Depends} Recommends: libmath-bigint-gmp-perl, libmath-prime-util-gmp-perl (>= 0.51), perl (>= 5.19.9) | libdigest-sha-perl (>= 5.87) Description: utilities related to prime numbers, including fast sieves and factoring Math::Prime::Util is a set of perl 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 Math::Prime::XS, Math::Prime::FastSieve, Math::Factor::XS, Math::Prime::TiedArray, Math::Big::Factors, Math::Factoring, and Math::Primality (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 Math::Pari 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. However, performance will be improved for most big number functions by installing Math::Prime::Util::GMP, and is definitely recommended if you do many bignum operations. Also look into Math::Pari as an alternative.