Math-Prime-Util-GMP

Changes for version 0.40 - 2016-08-01

ADDED
- sqrtint(n) Integer square root of n
- rootint(n,k) Integer k-th root of n
- is_prime_power(n) Returns k if n=p^k for p a prime.
OTHER
- is_perrin_pseudoprime 2x faster. Takes optional second argument for additional restrictions.

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)