Math-Prime-Util

Changes for version 0.34 - 2013-11-19

Fixed test that was using a 64-bit number on 32-bit machines.
Switch a couple internal arrays from UV to uint32 in prime count. This reduces memory consumption a little with big counts. Total memory use for counts > 10^15 is about 5x less than in version 0.31.

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

Primality proofs and certificates

A tied array for primes

An object iterator 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)