Home
Class 11
MATHS
We wish to select 6 persons from 8 pers...

We wish to select 6 persons from 8 persons, but if the person A is chosen, then B must be chosen. Then the number of ways the selection can be made is

A

15

B

7

C

22

D

20

Text Solution

Verified by Experts

The correct Answer is:
C
Promotional Banner

Topper's Solved these Questions

  • MODEL TEST PAPER -3

    ICSE|Exercise SECTION -B|10 Videos

  • MODEL TEST PAPER -3

    ICSE|Exercise SECTION C|18 Videos

  • MODEL TEST PAPER -2

    ICSE|Exercise Section C |8 Videos

  • MODEL TEST PAPER -4

    ICSE|Exercise SECTION -C|10 Videos

Similar Questions

Explore conceptually related problems

We wish to select 6 persons from 8, but if the person A is chosen, then B must be chosen. In how many ways can the selections be made?

We wish to select 6 persons from 8, but if the person A is chosen, then B must be chosen. In how many ways can the selections be made? 15 (b) 22 (c) 7 (d) None of these

There are p copies each of n different books. Find the number of ways in which a nonempty selection can be made from them.

There are p copies each of n different books. Find the number of ways in which a nonempty selection can be made from them.

5 different objects are to be distributed among 3 persons such that no two persons get the same number of objects. Number of ways this can be done is,

A is a set containing n elements . A subet P of A is chosen at random. The set A is reconstructed by replacing the elements of P.A subet Q is again chosen at random. The number of ways of selecting P and Q, is .

A person has 5 shirts, 4 coat and 7 ties . Number of ways in which he can wear them is

Diseases which can be transmitted from person to person by close contact are

In how many ways can a party of 6 men be selected out of 10 Hindus, 8 Muslims, and 6 Christians, if the party consists of atleast one person of each religion? Find the number of ways of selection. (Consider only the religion of the person).

A person is permitted to selected at least one and at most n coins from a collection of (2n+1) distinct coins. If the total number o ways in which he can select coins is 255, find the value of ndot