Permutations and CombinationsMCQPYQ Jun 23Question 1700 of 251
All Questions

A committee of 3 women and 4 men is to be formed out of 5 women and 7 men. Mrs. X can refuse to serve in a committee in which Mr. Y is a member. The no. of such committees can be:

Options

A1530
B1500
C1520
D1540
For any discrepancies in this question, email contact@cadada.in

Correct Answer

✅ Option d — 1540

All Options:

  • A1530
  • B1500
  • C1520
  • D1540

Ad

Detailed Solution & Explanation

We need to form a committee of 3 women and 4 men. The pool of candidates is 8 women (noted as 5 in the question text due to a typographical error in the source book, which we will mathematically demonstrate) and 7 men.
We are given the restriction: Mrs. X (a woman) refuses to serve in the committee if Mr. Y (a man) is a member.

**1. Let's solve using the correct pool of 8 women and 7 men (which leads to the textbook answer 1540):**
- **Total committees without restrictions**:
Select 3 women from 8 and 4 men from 7:
Total=8C3×7C4=56×35=1960 ways\text{Total} = ^8C_3 \times ^7C_4 = 56 \times 35 = 1960 \text{ ways}
- **Unwanted committees where both Mrs. X and Mr. Y are present**:
If Mrs. X is in the committee, we only need to select 2 more women from the remaining 7: 7C2=21\displaystyle ^7C_2 = 21 ways.
If Mr. Y is in the committee, we only need to select 3 more men from the remaining 6: 6C3=20\displaystyle ^6C_3 = 20 ways.
Unwanted=7C2×6C3=21×20=420 ways\text{Unwanted} = ^7C_2 \times ^6C_3 = 21 \times 20 = 420 \text{ ways}
- **Valid committees**:
Valid=1960−420=1540 ways\text{Valid} = 1960 - 420 = 1540 \text{ ways}
This perfectly matches Option D (1540).

**2. For completeness, let's solve using the literal text pool of 5 women and 7 men:**
- **Total without restrictions**:
Total=5C3×7C4=10×35=350 ways\text{Total} = ^5C_3 \times ^7C_4 = 10 \times 35 = 350 \text{ ways}
- **Unwanted committees with both Mrs. X and Mr. Y**:
Select 2 more women from remaining 4: 4C2=6\displaystyle ^4C_2 = 6 ways.
Select 3 more men from remaining 6: 6C3=20\displaystyle ^6C_3 = 20 ways.
Unwanted=6×20=120 ways\text{Unwanted} = 6 \times 20 = 120 \text{ ways}
- **Valid committees**:
Valid=350−120=230 ways\text{Valid} = 350 - 120 = 230 \text{ ways}
Since 230 is not in the options and 1540 is, this mathematically proves a typographical error in the question's text ("5 women" instead of "8 women").
Hence, **Option D** is the correct answer.

About This Chapter: Permutations and Combinations

Paper

Paper 3: Quantitative Aptitude

Weightage

4-6 Marks

Key Topics

Factorials, Permutations, Combinations

This chapter deals with the fundamental principles of counting. It covers factorials, circular permutations, restricted permutations, combinations, and the differences between selecting items versus arranging them.

View Official ICAI Syllabus

Exam Strategy Tip

The most common mistake is confusing 'P' (Arrangement) with 'C' (Selection). If order matters (like opening a lock), use P. If order doesn't matter (like choosing a team), use C.

Related Comparison Tables

Permutations vs Combinations: The Quantitative Aptitude Guide

More Questions from Permutations and Combinations

The value of N\displaystyle N in N!+17!=18!\displaystyle N! + \frac{1}{7!} = \frac{1}{8!} is

A person can go from place 'A' to 'B' by 11 different modes of transport but is allowed to return to 'A' by any mode other than the one earlier. The number of different ways in which the entire journey can be completed is:

If a man travels from place A to B in 10 ways then by how many ways can he come back by another train?

If n!10(n−1)!=(n−1)!(n−3)!\displaystyle \frac{n!}{10(n-1)!} = \frac{(n-1)!}{(n-3)!} find 'n'.

Which of the following is a correct statement.

nP3=2⋅nP2\displaystyle ^nP_3 = 2 \cdot ^nP_2. Find n\displaystyle n.

Ready to Master Permutations and Combinations?

Practice all 251 questions with instant feedback, earn XP, track your streaks, and ace your CA Foundation exam.

Start Practicing — It's Free