SOLUTION: A sheriff is choosing three shift commanders from 10 candidates who have expressed interest in the promotion. In how many ways can he do this?

Algebra ->  Permutations -> SOLUTION: A sheriff is choosing three shift commanders from 10 candidates who have expressed interest in the promotion. In how many ways can he do this?      Log On


   

Question 1146205: A sheriff is choosing three shift commanders from 10 candidates who have expressed interest in the promotion. In how many ways can he do this?
Found 2 solutions by richwmiller, ikleyn:
Answer by richwmiller(17219) About Me  (Show Source):
Answer by ikleyn(52781) About Me  (Show Source):
You can put this solution on YOUR website!
.
The order in this selection does not matter, so the problem is about COMBINATIONS, not about permutations.


The answer is  


C%5B10%5D%5E3 = %2810%2A9%2A8%29%2F%281%2A2%2A3%29 = 120.