Math-Prime-Util-GMP

Dana Jacobsen /

Math-Prime-Util-GMP-0.07

Changes for version 0.07

Tiny speedup when passing in bigints.
Some speedups in pbrent, pbrent usage, and small prime iterator. Factoring small (< ~30 digit) numbers is faster.
Handle large and small M-R bases just like MPU does -- mod with n, then return 1 if base <= 1 or base >= n-1.

Utilities related to prime numbers and factoring, using GMP

To install Math::Prime::Util::GMP, copy and paste the appropriate command in to your terminal.

cpanm Math::Prime::Util::GMP

perl -MCPAN -e shell
install Math::Prime::Util::GMP

For more information on module installation, please visit the detailed CPAN module installation guide.

	Global
`s`	Focus search bar
`?`	Bring up this help dialog

	GitHub
`g` `p`	Go to pull requests
`g` `i`	go to github issues (only if github is preferred repository)

	Search terms
module: (e.g. module:Plugin)
distribution: (e.g. distribution:Dancer auth)
author: (e.g. author:SONGMU Redis)
version: (e.g. version:1.00)