| Name : perl-Math-Prime-Util-GMP
| |
| Version : 0.32
| Vendor : obs://build_opensuse_org/devel:languages:perl
|
| Release : 2.5
| Date : 2016-04-07 17:56:52
|
| Group : Development/Libraries/Perl
| Source RPM : perl-Math-Prime-Util-GMP-0.32-2.5.src.rpm
|
| Size : 0.47 MB
| |
| Packager : (none)
| |
| Summary : Utilities related to prime numbers and factoring, using GMP
|
Description :
A module for number theory in Perl using GMP. This includes primality
tests, getting primes in a range, factoring, and more.
While it certainly can be used directly, the main purpose of this module is
for the Math::Prime::Util manpage. That module will automatically load this
one if it is installed, greatly speeding up many of its operations on big
numbers.
Inputs and outputs for big numbers are via strings, so you do not need to
use a bigint package in your program. However if you do use bigints, inputs
will be converted internally so there is no need to convert before a call.
Output results are returned as either Perl scalars (for native-size) or
strings (for bigints). the Math::Prime::Util manpage tries to reconvert all
strings back into the callers bigint type if possible, which makes it more
convenient for calculations.
The various \'is_*_pseudoprime\' tests are more appropriately called
\'is_*_probable_prime\' or \'is_*_prp\'. They return 1 if the input is a
probable prime based on their test. The naming convention is historical and
follows Pari, the Math::Primality manpage, and some other math packages.
The modern definition of pseudoprime is a _composite_ that passes the test,
rather than any number.
|
RPM found in directory: /packages/linux-pbone/ftp5.gwdg.de/pub/opensuse/repositories/devel:/languages:/perl/SLE_12/x86_64 |
Hmm ... It's impossible ;-) This RPM doesn't exist on any FTP server
Provides :
GMP.so()(64bit)
perl(Math::Prime::Util::GMP)
perl-Math-Prime-Util-GMP
perl-Math-Prime-Util-GMP(x86-64)
Requires :
