I have forgotten
my Password

Or login with:

  • Facebookhttp://facebook.com/
  • Googlehttps://www.google.com/accounts/o8/id
  • Yahoohttps://me.yahoo.com
get GPL
COST (GBP)
this unit 0.20
sub units 0.00
+
0

Combin

Calculates the number of combinations for a given set of data.
Controller: CodeCogs

get GPL add to cart

Interface

C++

Combin

 
doublecombinintn
intk )
Returns the number of combinations for a given number of items. Use Combin to determine the total possible number of groups for a given number of items. A combination is any set or subset of items, regardless of their internal order. Combinations are distinct from permutations, for which the internal order is significant. The number of combinations of n items with k items in each combination is given by the following formula:

where:

Example 1

#include <codecogs/statistics/moments/combin.h>
#include <iostream>
int main()
 {
   double com = Stats::Moments::combin(9, 5);
   std::cout << "The number of combinations is: " << com << std::endl;
  return 0;
}
Output:
The number of combinations is: 126

Parameters

nthe total number of items.
kthe number of items in each combination. k must be less than n.

Returns

the number of combinations for a given number of items

Authors

Anca Filibiu (August 2005)
Source Code

Source code is available when you agree to a GP Licence or buy a Commercial Licence.

Not a member, then Register with CodeCogs. Already a Member, then Login.