GitHub - hurchalla/Math-Prime-Util: Perl (XS) module implementing prime number utilities, including sieves

hurchalla / Math-Prime-Util Public

forked from danaj/Math-Prime-Util

Notifications You must be signed in to change notification settings
Fork 0
Star 0

Perl (XS) module implementing prime number utilities, including sieves

View license

0 stars 21 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 2,333 Commits
.github/workflows		.github/workflows
bench		bench
bin		bin
examples		examples
inc/Devel		inc/Devel
lib		lib
t		t
xt		xt
.gitignore		.gitignore
.travis.yml		.travis.yml
CMakeLists.txt		CMakeLists.txt
Changes		Changes
LICENSE		LICENSE
MANIFEST		MANIFEST
Makefile.PL		Makefile.PL
README		README
TODO		TODO
XS.xs		XS.xs
aks.c		aks.c
aks.h		aks.h
almost_primes.c		almost_primes.c
almost_primes.h		almost_primes.h
cache.c		cache.c
cache.h		cache.h
chacha.c		chacha.c
chacha.h		chacha.h
constants.h		constants.h
cpanfile		cpanfile
csprng.c		csprng.c
csprng.h		csprng.h
ds_pagelist32.h		ds_pagelist32.h
ds_pagelist64.h		ds_pagelist64.h
entropy.c		entropy.c
entropy.h		entropy.h
factor.c		factor.c
factor.h		factor.h
inverse_interpolate.c		inverse_interpolate.c
inverse_interpolate.h		inverse_interpolate.h
keyval.h		keyval.h
legendre_phi.c		legendre_phi.c
legendre_phi.h		legendre_phi.h
lehmer.c		lehmer.c
lehmer.h		lehmer.h
lmo.c		lmo.c
lmo.h		lmo.h
lucky_numbers.c		lucky_numbers.c
lucky_numbers.h		lucky_numbers.h
mathl.h		mathl.h
montmath.h		montmath.h
mulmod.h		mulmod.h
multicall.h		multicall.h
omega_primes.c		omega_primes.c
omega_primes.h		omega_primes.h
perfect_powers.c		perfect_powers.c
perfect_powers.h		perfect_powers.h
powerfree.c		powerfree.c
powerfree.h		powerfree.h
ppport.h		ppport.h
primality.c		primality.c
primality.h		primality.h
prime_count_cache.c		prime_count_cache.c
prime_count_cache.h		prime_count_cache.h
prime_count_tables.h		prime_count_tables.h
prime_counts.c		prime_counts.c
prime_counts.h		prime_counts.h
prime_powers.c		prime_powers.c
prime_powers.h		prime_powers.h
prime_sums.c		prime_sums.c
prime_sums.h		prime_sums.h
ptypes.h		ptypes.h
ramanujan_primes.c		ramanujan_primes.c
ramanujan_primes.h		ramanujan_primes.h
random_prime.c		random_prime.c
random_prime.h		random_prime.h
real.c		real.c
real.h		real.h
rootmod.c		rootmod.c
rootmod.h		rootmod.h
semi_primes.c		semi_primes.c
semi_primes.h		semi_primes.h
sieve.c		sieve.c
sieve.h		sieve.h
sieve_cluster.c		sieve_cluster.c
sieve_cluster.h		sieve_cluster.h
test.cpp		test.cpp
threadlock.h		threadlock.h
twin_primes.c		twin_primes.c
twin_primes.h		twin_primes.h
util.c		util.c
util.h		util.h

Repository files navigation

Math::Prime::Util version 0.73

A module for number theory in Perl.  This includes prime sieving, primality
tests, primality proofs, integer factoring, counts / bounds / approximations
for primes, nth primes, and twin primes, random prime generation,
and much more.

The default sieving and factoring are intended to be the fastest on CPAN.
Current measurements show it is faster than:
  Math::Prime::XS
  Math::Prime::FastSieve
  Math::Factor::XS
  Math::Big
  Math::Big::Factors
  Math::Factoring
  Math::Primality
  Math::Prime::TiedArray
  Crypt::Primes
  Math::ModInt::ChineseRemainder
For non-bignums, it is typically faster than Math::Pari (and doesn't
require Pari to be installed).  With Math::Prime::Util::GMP installed
it is usually faster than Math::Pari for bigints.


SYNOPSIS

  use Math::Prime::Util qw/primes/;

  # Get a big array reference of many primes
  my $aref = primes( 100_000_000 );

  # All the primes between 5k and 10k inclusive in a regular array
  my @primes = @{ primes( 5_000, 10_000 ) };

See the POD module documentation for examples and more information on all the
methods included.


INSTALLATION

To install this module type the following:

   perl Makefile.PL
   make
   make test
   make install

You will need a C compiler compatible with the compiler used to build Perl.
Since the routines are meant to be used from Perl, the data types will match
the ones used with the Perl you are installing for.  This means a 32-bit Perl
running on a 64-bit machine will result in a 32-bit library.


DEPENDENCIES

Perl 5.6.2 or later (5.8 or later is preferred).

Bytes::Random::Secure::Tiny 1.002 or later.


COPYRIGHT AND LICENCE

Copyright (C) 2011-2021 by Dana Jacobsen <[email protected]>

This library is free software; you can redistribute it and/or modify
it under the same terms as Perl itself.