Search results for "module:prime"
Math::Prime::XS - Detect and calculate prime numbers with deterministic tests
"Math::Prime::XS" detects and calculates prime numbers by either applying Modulo operator division, the Sieve of Eratosthenes, a Summation calculation or Trial division....
KRYDE/Math-Prime-XS-0.27 - 03 Sep 2016 04:08:48 UTC
Math::Prime::Util - Utilities related to prime numbers, including fast sieves and factoring
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. This module is th...
DANAJ/Math-Prime-Util-0.73 - 15 Nov 2018 18:56:14 UTC
Math::Prime::Util::PP - Pure Perl version of Math::Prime::Util
Pure Perl implementations of prime number utilities that are normally handled with XS or GMP. Having the Perl implementations (1) provides examples, (2) allows the functions to run even if XS isn't available, and (3) gives big number support if Math:...
DANAJ/Math-Prime-Util-0.73 - 15 Nov 2018 18:56:14 UTC
Math::Prime::FastSieve - Generate a list of all primes less than or equal to $n. Do it quickly.
This module provides an optimized implementation of the Sieve of Eratosthenes, and uses it to return a reference to an array all primes up to any integer specified, within the limitations of addressable memory. Additionally the module provides access...
DAVIDO/Math-Prime-FastSieve-0.19 - 27 Jul 2013 05:38:25 UTC
Math::Prime::Util::GMP - Utilities related to prime numbers and factoring, using GMP
A module for number theory in Perl using GMP. This includes primality tests, getting primes in a range, factoring, and more. While it certainly can be used directly, the main purpose of this module is for Math::Prime::Util. That module will automatic...
DANAJ/Math-Prime-Util-GMP-0.52 - 22 Jun 2020 09:19:08 UTC
Math::Prime::TiedArray - Simulate an infinite array of prime numbers
Allows access to an array of prime numbers, that will be extended as-needed: use Math::Prime::TiedArray; my @primes; tie @primes, "Math::Prime::TiedArray"; # print the first 100 primes: print join ", ", @primes[0..99]; # print the 200th prime: print ...
ZIGDON/Math-Prime-TiedArray-0.04 - 03 Aug 2007 20:16:33 UTC
Acme::PERLANCAR::Prime - Return prime numbers
This distribution is created for testing only....
PERLANCAR/Acme-PERLANCAR-Prime-0.001 - 23 Sep 2016 09:21:06 UTC
Math::Prime::Util::ChaCha - Pure Perl ChaCha20 CSPRNG
A pure Perl implementation of ChaCha20 with a CSPRNG interface....
DANAJ/Math-Prime-Util-0.73 - 15 Nov 2018 18:56:14 UTC
Math::Prime::Util::Entropy - Get a good random seed
Provides a single method to get a good seed if possible. This is a streamlined version of Crypt::Random::Seed, with ideas from Bytes::Random::Secure::Tiny. entropy_bytes Takes a number of bytes "n" and returns either undef (no good seed available) or...
DANAJ/Math-Prime-Util-0.73 - 15 Nov 2018 18:56:14 UTC
Math::Prime::Util::MemFree - An auto-free object for Math::Prime::Util
This is a more robust way of making sure any cached memory is freed, as it will be handled by the last "MemFree" object leaving scope. This means if your routines were inside an eval that died, things will still get cleaned up. If you call another fu...
DANAJ/Math-Prime-Util-0.73 - 15 Nov 2018 18:56:14 UTC
Math::Prime::Util::PrimeArray - A tied array for primes
An array that acts like the infinite set of primes. This may be more convenient than using Math::Prime::Util directly, and in some cases it can be faster than calling "next_prime" and "prev_prime". If the access pattern is ascending or descending, th...
DANAJ/Math-Prime-Util-0.73 - 15 Nov 2018 18:56:14 UTC
Bencher::Scenario::SPVM::Prime - Benchmark SPVM (check if number is prime)
Packaging a benchmark script as a Bencher scenario makes it convenient to include/exclude/add participants/datasets (either via CLI or Perl code), send the result to a central repository, among others . See Bencher and bencher (CLI) for more details....
PERLANCAR/Bencher-Scenarios-SPVM-0.008 - 24 Nov 2022 14:59:29 UTC
Math::Prime::Util::PrimeIterator - An object iterator for primes
An iterator over the primes. "new" returns an iterator object and takes an optional starting position (the initial value will be the least prime greater than or equal to the argument). BigInt objects will be returned if the value overflows a Perl uns...
DANAJ/Math-Prime-Util-0.73 - 15 Nov 2018 18:56:14 UTC
WordList::Number::Prime::First10000 - First 10,000 prime numbers
This wordlist is mostly for testing purposes only....
PERLANCAR/WordList-Number-Prime-First10000-0.001 - 02 Apr 2018 09:38:41 UTC
ArrayData::Number::Prime::First1000 - List of first 1000 prime numbers
Mainly for testing ArrayData....
PERLANCAR/ArrayData-Number-Prime-First1000-0.002 - 27 Mar 2022 02:52:10 UTC
Alt::Math::Prime::FastSieve::Inline - Alternate Math::Prime::FastSieve using Inline::Module
This is an alternate version of Math::Prime::FastSieve that is made with Inline::Module and Inline::CPP. It is the first Inline::CPP module to be done this way....
INGY/Alt-Math-Prime-FastSieve-Inline-0.09 - 30 Dec 2014 01:18:07 UTC