BSD Ports

math/p5-Math-Prime-Util-GMP 0.54 NetBSD

Perl5 Utilities related to prime numbers and factoring, using GMP

System
NetBSD
Repository
pkgsrc
Maintainer
[email protected]
Last update
Commit
83b8254502
License
gnu-gpl-v2 OR artistic
Categories
math, perl5
Package size
268.4 KiB, 850.1 KiB installed

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 Math::Prime::Util. That module will automatically load this one if it is installed, greatly speeding up many of its operations on big numbers.

In the other systems

SystemPortVersion
NetBSDmath/p5-Math-Prime-Util-GMP0.54
FreeBSDmath/p5-Math-Prime-Util-GMP0.54
OpenBSDmath/p5-Math-Prime-Util-GMP0.53
DragonFlymath/p5-Math-Prime-Util-GMP0.52
HardenedBSDmath/p5-Math-Prime-Util-GMP0.54
GhostBSDmath/p5-Math-Prime-Util-GMP0.54

Install

Binary package:

pkgin install p5-Math-Prime-Util-GMP

From pkgsrc:

cd /usr/pkgsrc/math/p5-Math-Prime-Util-GMP && make install clean

Packages

The version each package repository carries. “-” means the repository builds no package of it, “n/a” that there is no such repository.

RepositoryVersion
NetBSD 10.1 x86_640.54
NetBSD 10.1 aarch64-
SmartOS / illumos x86_640.54
macOS 15 arm640.54

Dependencies

Run dependencies 2

Commit history 2

DateCommitCreditsLog message
83b8254502 wiz p5-Math-Prime-Util-GMP: update to 0.54.
0.54 2026-08-08 [API CHANGES] - lucas_sequence and is_frobenius_pseudoprime take any integer P,Q instead of only native. - multifactorial supports large integer n,m. m must be positive. - factor accepts negative inputs. In list context, negative inputs have a leading -1 factor. Scalar context counts factors of the absolute value and does not count the sign. - Ranged moebius and euler_phi, plus sieve_primes, sieve_twin_primes, and sieve_prime_cluster, return the result count in scalar context. [ADDED] - muladdint(a,b,c) returns a*b+c - mulsubint(a,b,c) returns a*b-c - addmulint(a,b,c) returns a+b*c - submulint(a,b,c) returns a-b*c …
618415630a wiz *: recursive bump for perl5 5.44.0