Difference between revisions of "Combinations"
m (→See Also) |
|||
| Line 16: | Line 16: | ||
* [[Permutations]] | * [[Permutations]] | ||
* [[Factorial]] | * [[Factorial]] | ||
| + | * [[Partitions]] | ||
* [[LGamma]] | * [[LGamma]] | ||
Latest revision as of 20:10, 13 April 2017
Combinations(k, n)
«n» choose «k». The number of unique ways that «k» items can be chosen from a set of «n elements (without replacement and ignoring the order).
Library
Advanced math
Example
Combinations(2, 4) → 6
They are: {1, 2}, {1, 3}, {1, 4}, {2, 3}, {2, 4}, {3, 4}
See Also
Comments
Enable comment auto-refresher