Difference between revisions of "Combinations"
m (adding doc status category stub page) |
(Copied content from user guide and changed status) |
||
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 = | ||
+ | |||
+ | :Combinations(2,4) → 6 | ||
+ | |||
+ | They are: {1,2}, {1,3}, {1,4}, {2,3}, {2,4}, {3,4} | ||
+ | |||
+ | = See Also = | ||
+ | |||
+ | * [[Permutations]] | ||
+ | * [[Factorial]] | ||
+ | * [[LGamma]] |
Revision as of 21:28, 10 July 2007
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