Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Suppose that a department contains\(10\)men and\(15\)women. How many ways are there to form a committee with six members if it must have more women than men?

Short Answer

Expert verified

There is \(96460\)ways.

Step by step solution

01

Definitions of Product rule, Permutation, and Combination

Product rule: If one event can occur in\(m\)ways and a second event can occur in\(n\)ways, then the number of ways that the two events can occur in sequence is then \(m \cdot n\).

Definition permutation (order is important):

\(P(n,r) = \frac{{n!}}{{(n - r)!}}\)

Definition combination (order is not important):

\(C(n,r) = \left( {\begin{array}{*{20}{l}}n\\r\end{array}} \right) = \frac{{n!}}{{r!(n - r)!}}\)with\(n! = n \cdot (n - 1) \cdot \ldots \cdot 2 \cdot 1\)

02

Consider there are more than \(3\) women and less than \(3\) men and use the product rule

\(4\)women and \(2\) men:

\(4\)of the \(15\) women should be selected.

\(\begin{array}{l}C(15,4) = \frac{{15!}}{{4!(15 - 4)!}}\\C(15,4) = \frac{{15!}}{{4!11!}}\\C(15,4) = 1365\end{array}\)

\(2\)of the \(10\) men should be selected.

\(\begin{array}{l}C(10,2) = \frac{{10!}}{{2!(10 - 2)!}}\\C(10,2) = \frac{{10!}}{{2!8!}}\\C(10,2) = 45\end{array}\)

Use the product rule:

\(1365 \cdot 45 = 61425\)

03

Consider there are more than \(3\) women and less than \(3\) men and simplify by the product rule

\(5\)women and \(1\) man:

\(5\)of the \(15\) women should be selected.

\(C(15,5) = \frac{{15!}}{{5!(15 - 5)!}} = \frac{{15!}}{{5!10!}} = 3003\)

\(1\)of the\(10\)men should be selected.

\(C(10,1) = \frac{{10!}}{{1!(10 - 1)!}} = \frac{{10!}}{{1!9!}} = 10\)

Use the product rule:

\(3003 \cdot 10 = 30030\)

04

Consider there are more than \(3\) women and less than \(3\) men and use the product rule then add the values

\(6\)women and\(0\)men:

\(6\)of the\(15\)women should be selected.

\(C(15,6) = \frac{{15!}}{{6!(15 - 6)!}} = \frac{{15!}}{{6!9!}} = 5005\)

\(0\)of the\(10\)men should be selected.

\(C(10,0) = \frac{{10!}}{{0!(10 - 0)!}} = \frac{{10!}}{{0!10!}} = 1\)

Use the product rule:

\(5005 \cdot 1 = 5005\)

Use the sum rule:

\(61425 + 30030 + 5005 = 96460\)

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

One hundred tickets, numbered \(1,2,3, \ldots ,100\), are sold to \(100\) different people for a drawing. Four different prizes are awarded, including a grand prize (a trip to Tahiti). How many ways are there to award the prizes if

a) there are no restrictions?

b) the person holding ticket \(47\) wins the grand prize?

c) the person holding ticket \(47\) wins one of the prizes?

d) the person holding ticket \(47\) does not win a prize?

e) the people holding tickets \(19\) and \(47\) both win prizes?

f) the people holding tickets \(19\;,\;47\)and \(73\) all win prizes?

g) the people holding tickets \(19\;,\;47\;,\;73\) and \(97\) all win prizes?

h) none of the people holding tickets \(19\;,\;47\;,\;73\) and \(97\) wins a prize?

i) the grand prize winner is a person holding ticket \(19\;,\;47\;,\;73\) or \(97\)?

j) the people holding tickets 19 and 47 win prizes, but the people holding tickets \(73\) and \(97\) do not win prizes?

Describe an algorithm for generating all the combinations of the set of the n smallest positive integers.

7. How many ways are there to select three unordered elements from a set with five elements when repetition is allowed?

Find the number of 5-permutations of a set with nine elements.

How many ways are there to choose 6 items from 10 distinct items when

a) the items in the choices are ordered and repetition is not allowed?

b) the items in the choices are ordered and repetition is allowed?

c) the items in the choices are unordered and repetition is not allowed?

d) the items in the choices are unordered and repetition is allowed?

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free