Math-Prime-Util

Changes for version 0.27

is_prime, is_prob_prime, next_prime, and prev_prime now all go straight to XS if possible. This makes them much faster for small inputs without having to use the -nobigint flag.
XS simple number validation to lower function call overhead. Still a lot more overhead compared to directly calling the XS functions, but it shaves a little bit of time off every call.
Speedup pure Perl factoring of small numbers.
is_prob_prime / is_prime about 10% faster for composites.
Allow '+N' as the second parameter to primes.pl. This allows: primes.pl 100 +30 to return the primes between 100 and 130. Or: primes.pl 'nth_prime(1000000000)' +2**8
Use EXTENDED_TESTING to turn on extra tests.

Utilities related to prime numbers, including fast sieves and factoring

Elliptic curve operations for affine points

Elliptic curve operations for projective points

An auto-free object for Math::Prime::Util

Pure Perl version of Math::Prime::Util

A tied array for primes

Perl Big Float versions of Riemann Zeta and R functions

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

cpanm Math::Prime::Util

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

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)