Nandan gives dinner party to six guests. The number of ways in which they may be selected from ten friends if two of the friends will not attend the party together is: (a) 112 (b) 140 (c) 164 (d) 146

Short Answer

Expert verified
The short answer to the question is that there are 140 ways to invite 6 guests to Nandan's dinner party given the conditions (b) 140.

Step by step solution

01

Case 1: A attends, but B doesn't

Out of 10 friends, if A attends, then B cannot attend. So, we have 8 remaining friends to choose from (excluding A and B). Since we need 6 guests, we only need to invite 5 more from the remaining 8 friends. This can be done in \( \binom{8}{5} \) ways.
02

Case 2: B attends, but A doesn't

This case is similar to case 1. If B attends, then A cannot attend. So, we have 8 remaining friends to choose from (excluding A and B). Since we need 6 guests, we only need to invite 5 more from the remaining 8 friends. This can be done in \( \binom{8}{5} \) ways.
03

Case 3: Neither A nor B attends

If neither A nor B attend, we need to select all 6 guests from the remaining 8 friends. This can be done in \( \binom{8}{6} \) ways.
04

Total number of ways of selecting 6 guests

The total number of ways to invite 6 guests, as calculated above is the sum of the ways from each case: Total ways = (ways for case 1) + (ways for case 2) + (ways for case 3) Total ways = \( \binom{8}{5} \) + \( \binom{8}{5} \) + \( \binom{8}{6} \) Using the values of combinations, we can calculate the total ways as: Total ways = 56 + 56 + 28 = 140 Therefore, the correct answer is (b) 140.

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

If a polygon has 90 diagonals, the no. of its sides is given by (a) 12 (b) 11 (c) 10 (d) 15

In an examination a question paper consists of 10 questions which is divided into two parts. i.e. part \(i\) and part ii containing 5 and 7 questions respectively. A student is required to attempt 8 question in all selecting at least 3 from each part. In how many ways can a student select the questions (a) \({ }^{5} \mathrm{C}_{2} \cdot{ }^{7} \mathrm{C}_{2}+{ }^{5} \mathrm{C}_{1} \cdot{ }^{7} \mathrm{C}_{3}+{ }^{5} \mathrm{C}_{0} \cdot{ }^{7} \mathrm{C}_{4}\) (b) \({ }^{12} \mathrm{C}_{5} \cdot{ }^{12} \mathrm{C}_{7}\) (c) \({ }^{5} \mathrm{C}_{3} \cdot{ }^{7} \mathrm{C}_{5}\) (d) \({ }^{12} \mathrm{C}_{8}\)

In a circus there are 10 cages for accommodating 10 animals out of these 4 cages are so small that five out of ten animals can not enter into them. In how many ways will it be possible to accommodate 10 animals in these 10 cages? (a) 66400 (b) 86400 (c) 96400 (d) 46900

If a denotes the number of permutation of \(\mathrm{x}+2\) things taken all at a time, \(b\) the number of permutation of \(x\) things taken 11 at a time and \(c\) the number of permutation of \(x-11\) things taken all at a time such that \(\mathrm{a}=182 \mathrm{bc}\) then the value of \(\mathrm{x}\) is (a) 15 (b) 12 (c) 10 (d) 18

The first 12 letters of the english alphabet are to be written at random so that there are exactly 4 letters between \(\mathrm{A}\) and \(\mathrm{B}\). the number of ways this can be done is (a) \(7 \cdot 10 !\) (b) \(2 \cdot 10 !\) (c) \(21 \cdot 10 !\) (d) \(14 \cdot 10 !\)

See all solutions

Recommended explanations on English 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