| |
Refer to the CIA Hiring problem seen earlier.
You determined how many ways there were of selecting 2 applicants from a
total of 5, by simply enumerating all the possibilities.
There is a specific probability term for this (the number of
ways of arranging k objects from a set of n objects without regard
to the order in which the objects are arranged).
Think:
- Determine the above term, and use the corresponding associated formula to calculate
the number (call it N) you determined by simple enumeration.
Verify that the two results agree.
- Consider an event, A, where exactly one of the two best applicants
appears in a selection of 2 out of 5 applicants.
The CIA would like to find out the number of ways that this can happen
(i.e. the number of sample points) nA, and also the
probability of this event happening, P(A).
Your mission (should you choose to accept it )
is to answer the CIA's questions.
Here are the steps to accomplish this:
- Determine the number of ways of selecting one of the 2 best applicants, m.
Determine the number of ways of selecting one of the 3 least competent
applicants, n.
- Determine nA by multiplying the above two
results. Explain why this works.
You can verify that this value is correct by going back to your
enumeration of pairs in the original problem, and counting how many pairs
contain exactly one of the two best applicants.
- Assuming, as before, that every selection is equally probable, and using
the value for nA you have just determined, calculate the
probability of A occurring.
|