**Math::Combinatorics - Perform combinations and permutations on lists**

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: http://mathworld.wolfram.com/Co...

ALLENDAY/Math-Combinatorics-0.09 - 12 Dec 2006 07:04:03 GMT**Math::Counting - Combinatorial counting operations**

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 GMT**Math::DyckWords - Perl module for generating Dyck words. Dyck words are named after the mathematician Walther von Dyck.**

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 GMT**Telephone::Mnemonic::US::Math - Helper module that for combinatorics pertaining to mnemonic calculations**

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

**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 GMT**Math::NumSeq::Factorials - factorials i! = 1*2*...*i**

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

KRYDE/Math-NumSeq-74 - 23 Feb 2020 03:55:27 GMT**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-0.008 - 17 Sep 2019 23:17:47 GMT**Math::PlanePath::HilbertCurve - 2x2 self-similar quadrant traversal**

This path is an integer version of the curve described by David 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, ... | | 7 | 63--62 49--48--47 44--43--42 | | | | | | 6 |...

KRYDE/Math-PlanePath-127 - 17 Aug 2019 13:14:00 GMT