You can put this solution on YOUR website!
Unfortunately, the previous solution is incorrect. Why? They're not looking for a probability, they just want to know the number of possible combinations.
We could use the counting principle to solve this problem, but we'll have overlap and the sample space is far too large. So let's do it this way:
In this case, order does NOT matter since the candidates have no rank over one another (ie one isn't president or secretary).
Since order does not matter, we must use the <a rel=nofollow HREF=http://www.mathwords.com/c/combination_formula.htm>combination formula</a>:
Start with the combination formula.
to get 9
Multiply 15*14*13*12*11*10 to get 3,603,600
Multiply 6*5*4*3*2*1 to get 720
So 15 choose 6 (where order doesn't matter) yields 5,005 unique combinations
This means that there are 5,005 different ways to select a group of 6 college candidates from a group of 15 applicants for an interview (where the order of the candidates doesn't matter).