Math-Prime-Util-0.43

Changes for version 0.43 - 2014-08-16

ADDED
- foroddcomposites like forcomposites, but skips even numbers
- twin_primes as primes but for twin primes
- config: use_primeinc allow the fast but bad PRIMEINC random prime method
REMOVED DEPRECATED NAMES
- all_factors replaced in 0.36 by divisors
- miller_rabin replaced in 0.10 by is_strong_pseudoprime
FUNCTIONALITY AND PERFORMANCE
- Divisors sorted with qsort instead of Shell sort. No appreciable time difference, but slightly less code size.
- Added Micali-Schnorr generator to examples/csrand.pl. Made a version of csrand that uses Math::GMP for faster operation.
- Added synopsis release test. Thanks to Neil Bowers and Toby Inkster.
- ranged euler_phi is more efficient when lo < 100.
- factor for 49 to 64-bit numbers sped up slightly (a small p-1 is tried before SQUFOF for these sizes).
- HOLF factoring sped up using premultiplier first.

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

PP front end for Math::Prime::Util

Primality proofs and certificates

A tied array for primes

An object iterator for primes

Generate random primes

Perl Big Float versions of Riemann Zeta and R functions

in lib/Math/Prime/Util/PPFE.pm

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)