Search results for "module:Math::Prime::XS"
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::NumSeq::Primes - prime numbers
The prime numbers, not divisible by anything except themselves and 1. 2, 3, 5, 7, 11, 13, 17, 19, ... (A000040) starting i=1 Currently this is implemented with "Math::Prime::XS" generating blocks of primes with a sieve of Eratosthenes. The result is ...
KRYDE/Math-NumSeq-75 - 04 Jun 2022 12:11:23 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::FastGF2 - Perl extension for fast Galois Field arithmetic
This module provides an interface for performing single modulo arithmetic operations on Galois Field polynomials in GF(2^8), GF(2^16) and GF(2^32). All values to be operated on are simple Perl numeric scalars which are taken to represent polynomials ...
DMALONE/Math-FastGF2-0.07 - 13 Sep 2019 14:09:19 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::Factor::XS - Factorize numbers and calculate matching multiplications
"Math::Factor::XS" factorizes numbers by applying trial divisions....
KRYDE/Math-Factor-XS-0.40 - 16 Aug 2012 00:39:17 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::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::Polynomial::ModInt - univariate polynomials over modular integers
Math::Polynomial::ModInt is a subclass of Math::Polynomial for modular integer coefficient spaces. It adds domain-specific methods and stringification options to the base class. Notably, it implements a bijection from unsigned integers to polynomials...
MHASCH/Math-Polynomial-ModInt-0.005 - 04 Jun 2022 19:48:36 UTC
Math::NumSeq::DivisorCount - how many divisors
The number of divisors of i, 1, 2, 2, 3, 2, 4, 2, 4, 3, 4, 2, 6, 2, 4, 4, 5, 2, 6, 2, ... starting i=1 i=1 is divisible only by 1 so value=1. Then i=2 is divisible by 1 and 2 so value=2. Or for example i=6 is divisible by 4 numbers 1,2,3,6 so value=4...
KRYDE/Math-NumSeq-75 - 04 Jun 2022 12:11:23 UTC