Difference between revisions of "Combinations"

(Copied content from user guide and changed status)
 
(2 intermediate revisions by one other user not shown)
Line 2: Line 2:
 
[[Category:Doc Status C]] <!-- For Lumina use, do not change -->
 
[[Category:Doc Status C]] <!-- For Lumina use, do not change -->
  
= Combinations(k,n) =
+
== 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).
"''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 =
 
  
 +
== Library ==
 
Advanced math
 
Advanced math
  
= Example =
+
== Example ==
 
+
:<code>Combinations(2, 4) &rarr; 6</code>
:Combinations(2,4) &rarr; 6
 
 
 
They are: {1,2}, {1,3}, {1,4}, {2,3}, {2,4}, {3,4}
 
  
= See Also =
+
They are: <code>{1, 2}, {1, 3}, {1, 4}, {2, 3}, {2, 4}, {3, 4}</code>
  
 +
== See Also ==
 
* [[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


You are not allowed to post comments.