30 Oct 2019 16:09:23 UTC
- Distribution: Math-Counting
- Module version: 0.1307
- Source (raw)
- Browse (raw)
- How to Contribute
- Issues (0)
- Testers (375 / 0 / 0)
- KwaliteeBus factor: 1
- 96.55% Coverage
- License: perl_5
- Perl: v5.6.0
- Activity24 month
- Download (14.63KB)
- MetaCPAN Explorer
- Subscribe to distribution
- This version
- Latest versionGENE Gene Boggs
- TO DO
- SEE ALSO
- COPYRIGHT AND LICENSE
Math::Counting - Combinatorial counting operations
use Math::Counting ':student'; printf "Given n=%d, k=%d:\nF=%d\nP=%d\nC=%d\n", $n, $k, factorial($n), permutation($n, $k), combination($n, $k);
use Math::Counting ':big'; printf "Given n=%d, k=%d, r=%d:\nF=%d\nP=%d\nD=%d\nC=%d\n", $n, $k, $r, bfact($n), bperm($n, $k, $r), bderange($n), bcomb($n, $k, $r);
Compute the factorial, number of permutations, number of derangements and number of combinations.
:bigfunctions are wrappers around "bfac" in Math::BigInt with a bit of arithmetic between.
The student versions exist to illustrate the computation "in the raw" as it were. To see these computations in action, Use The Source, Luke.
$f = factorial($n);
Return the number of arrangements of n, notated as
This function employs the algorithmically elegant "student" version using real arithmetic.
$f = bfact($n);
Return the value of the function "bfac" in Math::BigInt, which is the "Right Way To Do It."
$p = permutation($n, $k);
Return the number of arrangements, without repetition, of k elements drawn from a set of n elements, using the "student" version.
$p = bperm($n, $k, $r);
Return the computations:
n^k # with repetition $r == 1 n! / (n-k)! # without repetition $r == 0
"A derangement is a permutation in which none of the objects appear in their "natural" (i.e., ordered) place." -- wolfram under "SEE ALSO"
Return the computation:
!n = n! * ( sum (-1)^k/k! for k=0 to n )
$c = combination($n, $k);
Return the number of ways to choose k elements from a set of n elements, without repetition.
This is algorithm expresses the "student" version.
$c = bcomb($n, $k, $r);
Return the combination computations:
(n+k-1)! / k!(n-1)! # with repetition $r == 1 n! / k!(n-k)! # without repetition $r == 0
Provide the gamma function for the factorial of non-integer numbers?
Higher Order Perl by Mark Jason Dominus (http://hop.perl.plover.com).
Mastering Algorithms with Perl by Orwant, Hietaniemi & Macdonald (http://www.oreilly.com/catalog/maperl).
Naturally, there are a plethora of combinatorics packages available, take your pick:
Special thanks to:
* Paul Evans
* Mike Pomraning
* Petar Kaleychev
* Dana Jacobsen
Gene Boggs <firstname.lastname@example.org>
This software is copyright (c) 2015 by Gene Boggs.
This is free software; you can redistribute it and/or modify it under the same terms as the Perl 5 programming language system itself.
Module Install Instructions
To install Math::Counting, copy and paste the appropriate command in to your terminal.
perl -MCPAN -e shell install Math::Counting
For more information on module installation, please visit the detailed CPAN module installation guide.