Difference between revisions of "Combinations"
m (adding doc status category stub page) |
m (→See Also) |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
[[category:Math Functions]] | [[category:Math Functions]] | ||
| − | [[Category:Doc Status | + | [[Category:Doc Status C]] <!-- For Lumina use, do not change --> |
| − | {{ | + | == 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 == | ||
| + | :<code>Combinations(2, 4) → 6</code> | ||
| + | |||
| + | They are: <code>{1, 2}, {1, 3}, {1, 4}, {2, 3}, {2, 4}, {3, 4}</code> | ||
| + | |||
| + | == See Also == | ||
| + | * [[Permutations]] | ||
| + | * [[Factorial]] | ||
| + | * [[Partitions]] | ||
| + | * [[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