Sisyphus repository
Last update: 2018-10-20 23:10:32 +0400 | SRPMs: 19735 | Sign in or Sign up
en ru uk br
ALT Linux repositories
hide window
Sisyphus: 0.71-alt1
Sisyphus: 0.72-alt1
p8: 0.57-alt1

Other repositories
hide window
CPAN: 0.72

Group :: Development/Perl
Source RPM: perl-Math-Prime-Util

 Main   Changelog   Spec   Patches   Sources   Download   Gear   Bugs and FR (0/0)   Repocop 

Current version: 0.71-alt1
Built: 3 months ago
Size: 601 KB
Repocop status: skip

Home page:

License: perl
Summary: Utilities related to prime numbers, including fast sieves and factoring

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

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.

Two scripts are also included and installed by default:

=over 4

=item * displays primes between start and end values or expressions,
with many options for filtering (e.g. twin, safe, circular, good, lucky,
etc.). Use `--help' to see all the options.

=item * operates similar to the GNU `factor' program. It supports
bigint and expression inputs.


Current maintainer: Igor Vlasenko

List of contributors: ACL: List of rpms provided by this srpm:
  • perl-Math-Prime-Util
  • perl-Math-Prime-Util-debuginfo
  • perl-Math-Prime-Util-scripts
Recent changes (last three changelog entries):

2018-09-02 Igor Vlasenko <viy at> 0.71-alt1

    - automated CPAN update

2017-12-18 Igor Vlasenko <viy at> 0.70-alt1

    - automated CPAN update

2017-12-15 Igor Vlasenko <viy at> 0.69-alt1.1

    - rebuild with new perl 5.26.1

© 2009–2018 Igor Zubkov