Log out Go to App
Go to App

Learning Materials

Features

Discover

Chapter 5: Problem 400

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.

Start your free trial

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

The value of \({ }^{47} \mathrm{C}_{4}+{ }^{5} \sum_{\mathrm{j}=1}{ }^{52-\mathrm{j}} \mathrm{C}_{3}\) is equal to (a) \({ }^{47} \mathrm{C}_{5}\) (b) \({ }^{52} \mathrm{C}_{5}\) (c) \({ }^{52} \mathrm{C}_{4}\) (d) \({ }^{53} \mathrm{C}_{7}\)

A man has 7 relative, 4 of them ladies and 3 gentlemen. His wife also have 7 relatives. 3 of them ladies and 4 gentlemen, They invite for a dinner partly 3 ladies and 3 gentlemen so that there are 3 of the men's relative and 3 of the wife's relative. The number of ways of invitation is (a) 854 (b) 585 (c) 485 (d) 548

12 Persons are to be arranged to a round table, If two particular persons among them are not to be side by side, the total number of arrangements is : (a) \(9(10 !)\) (b) \(2(10) !\) (c) \(45(\overline{8 !)}\) (d) \(10 !\)

Three boys and three girls are to be seated around a round table in a circle. Among them the boy \(\mathrm{X}\) does not want any girl neighbour and the girl \(\mathrm{Y}\) does not want any boy neighbour then the no. of arrangement is (a) 2 (b) 4 (c) 23 (d) 33

The number of numbers greater than 3000 , which can be formed by using the digits \(0,1,2,3,4,5\) without repetition is (a) 1240 (b) 1280 (c) 1320 (d) 1380
See all solutions

Recommended explanations on English Textbooks

Key Concepts in Language and Linguistics

Read Explanation

Lexis and Semantics Summary

Read Explanation

Rhetoric

Read Explanation

Language Analysis

Read Explanation

Email

Read Explanation

Essay Prompts

Read Explanation
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