An employer interviews people for computer programming positions in a company, and of the people are men. If all are qualified, in how many ways can the employer fill the computer programming positions if exactly is a man?

Thank you for the opportunity to help you with your question!

possible ways of choosing 3 men from 5 is: 5!/(3!2!) = 120/12 = 10

possible ways of choosing 2 women from 3 is: 3!/(2!1!) = 6/2 = 3

this gives us a total of 30 allowable combinations.

@Bryan G: what you have to realize, is that of your 6 combinations of choices, 3 of the are the same. Suppose the women are Mary, Jane and Sue.

so after the first choice, we have the follwing possibilites:

M, J, S

suppose Mary was chosen: that gives us the following possibilites:

MJ or MS (that's two)

now suppose Jane was chosen, our possible possibilites after the next choice is made are:

JM or JS. but choosing Jane then Mary, gives us the same outcome as choosing Mary, then Jane. so that's a duplication, and the only new combination is:

JS (that makes 3).

now suppose Sue is chosen first. that just leaves Mary and Jane left. but SM already occured as MS, and SJ already occured as JS, so there are no new possibilities left.

the same reasoning applies to the choices for the men, your list contains duplicates.

Please let me know if you need any clarification. I'm always happy to answer your questions.

Jul 28th, 2015

Studypool's Notebank makes it easy to buy and sell old notes, study guides, reviews, etc.