Search results for "module:Math::Prime::Simple"
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::Pari - Perl interface to PARI.
This package is a Perl interface to famous library PARI for numerical/scientific/number-theoretic calculations. It allows use of most PARI functions as Perl functions, and (almost) seamless merging of PARI and Perl data. In what follows we suppose pr...
ILYAZ/Math-Pari-2.030523 - 12 Apr 2022 09:21:44 UTC
Math::Utils - Useful mathematical functions not in Perl.
JGAMBLE/Math-Utils-1.14
-
21 Apr 2020 18:18:27 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::Primality - Check for primes with Perl
Math::Primality implements is_prime() and next_prime() as a replacement for Math::PARI::is_prime(). It uses the GMP library through Math::GMPz. The is_prime() method is actually a Baillie-PSW primality test which consists of two steps: * Perform a st...
LETO/Math-Primality-0.08 - 01 Feb 2013 06:35:23 UTC
Math::Polynomial - Perl class for polynomials in one variable
Math::Polynomial objects represent polynomials in one variable, i.e. expressions built with finitely many additions, subtractions and multiplications of the variable and some constants. A standard way of writing down a polynomial in one variable is a...
MHASCH/Math-Polynomial-1.021 - 03 Apr 2021 10:31:10 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
Bundle::Math::Numeric - Bundle of modules related to numeric algorithms
This is a bundle of modules related to numeric algorithms. Please have a look at Bundle::Math. If you would like to see a specific module included in a future version of this bundle, please send me an email or use rt.cpan.org....
SMUELLER/Bundle-Math-Numeric-1.00 - 05 Apr 2004 12:10:48 UTC
Math::Polynomial::Solve - Find the roots of polynomial equations.
This package supplies a set of functions that find the roots of polynomials, along with some utility functions. Roots will be either real or of type Math::Complex. Functions making use of the Sturm sequence are also available, letting you find the nu...
JGAMBLE/Math-Polynomial-Solve-2.86 - 02 Nov 2018 01:10:27 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::ContinuedFraction - Create and Manipulate Continued Fractions.
Continued fractions are expressions of the form b1 a1 + ------- b2 a2 + ------- b3 a3 + ------- ... For most instances, the 'b' terms are 1, and the continued fraction can be written as "[a1, a2, a3, ...]", etc. If the sequence of 'a' terms ends at a...
JGAMBLE/Math-ContinuedFraction-0.14 - 10 Apr 2019 20:29:34 UTC
Math::PlanePath::PyramidRows - points stacked up in a pyramid
This path arranges points in successively wider rows going upwards so as to form an upside-down pyramid. The default step is 2, ie. each row 2 wider than the preceding, an extra point at the left and the right, 17 18 19 20 21 22 23 24 25 4 10 11 12 1...
KRYDE/Math-PlanePath-129 - 19 Jan 2021 06:32:01 UTC
Math::DifferenceSet::Planar - object class for planar difference sets
A planar difference set in a modular integer ring ℤ_n, or cyclic planar difference set, is a subset D = {d_1, d_2, ..., d_k} of ℤ_n such that each nonzero element of ℤ_n can be represented as a difference (d_i - d_j) in exactly one way. By convention...
MHASCH/Math-DifferenceSet-Planar-1.001 - 24 Dec 2023 06:51:31 UTC
Math::PlanePath::SquareSpiral - integer points drawn around a square (or rectangle)
This path makes a square spiral,...
KRYDE/Math-PlanePath-129 - 19 Jan 2021 06:32:01 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