Search results for "module:Math::Combinatorics"

Math::Combinatorics - Perform combinations and permutations on lists River stage two • 5 direct dependents • 18 total dependents

Combinatorics is the branch of mathematics studying the enumeration, combination, and permutation of sets of elements and the mathematical relations that characterize their properties. As a jumping off point, refer to:

ALLENDAY/Math-Combinatorics-0.09 - 12 Dec 2006 07:04:03 UTC

Math::Pari - Perl interface to PARI. River stage two • 4 direct dependents • 17 total dependents

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::Counting - Combinatorial counting operations River stage one • 1 direct dependent • 1 total dependent

Compute the factorial, number of permutations, number of derangements and number of combinations. The ":big" functions are wrappers around "bfac" in Math::BigInt with a bit of arithmetic between. The student versions exist to illustrate the computati...

GENE/Math-Counting-0.1307 - 30 Oct 2019 16:09:23 UTC

Math::DyckWords - Perl module for generating Dyck words. Dyck words are named after the mathematician Walther von Dyck. River stage zero No dependents

Dyck words are even numbered string of X's and Y's, or 0's and 1's, or any other binary alphabet for that matter, such that no initial segment has more Y's or 1's. The following are the Dyck words of length 2n where n = 3: 000111 010011 010101 001101...

MMERTEL/Math-DyckWords-0.03 - 14 Apr 2010 03:48:57 UTC

Telephone::Mnemonic::US::Math - Helper module that for combinatorics pertaining to mnemonic calculations River stage zero No dependents

IOANNIS/Telephone-Mnemonic-US-0.07 - 17 Oct 2011 09:40:11 UTC

Math::Prime::Util - Utilities related to prime numbers, including fast sieves and factoring River stage two • 12 direct dependents • 18 total dependents

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::Permutation - pure Perl implementation of functions related to the permutations River stage zero No dependents

CYFUNG/Math-Permutation-0.01 - 28 Aug 2022 21:09:08 UTC

Math::NumSeq::Factorials - factorials i! = 1*2*...*i River stage zero No dependents

The factorials being product 1*2*3*...*i, 1 to i inclusive. 1, 2, 6, 24, 120, 720, ... starting i=1...

KRYDE/Math-NumSeq-75 - 04 Jun 2022 12:11:23 UTC

Math::DifferenceSet::Planar - object class for planar difference sets River stage zero No dependents

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-0.018 - 28 Aug 2022 11:00:46 UTC

Math::PlanePath::HilbertCurve - 2x2 self-similar quadrant traversal River stage one • 3 direct dependents • 4 total dependents

This path is an integer version of the curve described by Hilbert in 1891 for filling a unit square. It traverses a quadrant of the plane one step at a time in a self-similar 2x2 pattern, David Hilbert, "Ueber die stetige Abbildung einer Linie auf ei...

KRYDE/Math-PlanePath-129 - 19 Jan 2021 06:32:01 UTC
10 results (0.031 seconds)