Math-Prime-Util

Changes for version 0.21

Switch to using Bytes::Random::Secure for random primes. This is a big change in that it is the first non-CORE module used. However, it gets rid of lots of possible stupidness from system rand.
Spelling fixes in documentation.
primes.pl: Add circular and Panaitopol primes.
euler_phi and moebius now will compute over a range.
Add mertens function: 1000+ times faster than summing moebius($_).
Add exp_mangoldt function: exponential of von Mangoldt's function.
divisor_sum defaults to sigma if no sub is given (i.e. it sums).
Performance:
- Speedup factoring small numbers. With -nobigint factoring from 1 to 10M, it's 1.2x faster. 1.5x faster than Math::Factor::XS.
- Totient and Möbius over a range are much faster than separate calls.
- divisor_sum is 2x faster.
- primes.pl is much faster with Pillai primes.
- Reduce overhead in euler_phi -- about 2x faster for individual calls.

Utilities related to prime numbers, including fast sieves and factoring

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)