Math-Prime-Util-GMP

Changes for version 0.33 - 2015-09-04

ADDED
- sieve_twin_primes(low,high) sieve for twin primes
- is_miller_prime(n[,assumeGRH]) deterministic Miller test
PERFORMANCE
- New results from Sorenson and Webster let us give faster deterministic results for 65-82 bits. is_prime always returns {0,2} for this range.

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)