Perl (XS) module implementing prime number utilities, including sieves
License
danaj/Math-Prime-Util
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
master
Could not load branches
Nothing to show
Could not load tags
Nothing to show
{{ refName }}
default
Name already in use
A tag already exists with the provided branch name. Many Git commands accept both tag and branch names, so creating this branch may cause unexpected behavior. Are you sure you want to create this branch?
Code
-
Clone
Use Git or checkout with SVN using the web URL.
Work fast with our official CLI. Learn more.
- Open with GitHub Desktop
- Download ZIP
Sign In Required
Please sign in to use Codespaces.
Launching GitHub Desktop
If nothing happens, download GitHub Desktop and try again.
Launching GitHub Desktop
If nothing happens, download GitHub Desktop and try again.
Launching Xcode
If nothing happens, download Xcode and try again.
Launching Visual Studio Code
Your codespace will open once ready.
There was a problem preparing your codespace, please try again.
Latest commit
Files
Failed to load latest commit information.
Type
Name
Latest commit message
Commit time
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 <dana@acm.org> This library is free software; you can redistribute it and/or modify it under the same terms as Perl itself.
About
Perl (XS) module implementing prime number utilities, including sieves
Resources
License
Stars
Watchers
Forks
Packages 0
No packages published