Ask Question
22 March, 14:12

Rework problem 17 in your textbook but assume that there 8 fire stations that need new chiefs and 13 qualified candidates. in how many different ways could new chiefs be selected if each station gets a different chief

+1
Answers (1)
  1. 22 March, 15:42
    0
    There are two solutions for this problem. It depends if order matters or not. Since it is not mentioned in the problem, it is safe to assume that order does not matter and that choosing can be done at random. Then, this is a combination problem:

    nCr = n!/r! (n-r) !

    where n=13 because there are 13 qualified candidates, and r=8 because you choose 8 chiefs at a time

    nCr = 13!/8! (13-8) ! = 1,287 ways
Know the Answer?
Not Sure About the Answer?
Find an answer to your question ✅ “Rework problem 17 in your textbook but assume that there 8 fire stations that need new chiefs and 13 qualified candidates. in how many ...” in 📘 Mathematics if you're in doubt about the correctness of the answers or there's no answer, then try to use the smart search and find answers to the similar questions.
Search for Other Answers