Math-Prime-Util

Changes for version 0.24

Fix compilation with old pre-C99 strict compilers (decl after statement).
euler_phi on a range wasn't working right with some ranges.
More XS prime count improvements to speed and space. Add some tables to the sieve count so it runs a bit faster. Transition from sieve later.
PP prime count for 10^9 and larger is ~2x faster and uses much less memory. Similar impact for nth_prime 10^8 or larger.
Let factor.pl accept expressions just like primes.pl.

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)