SOLVER7 Study. Nothing Else.
Miscellaneous Exercise Chapter 6 Q10

From a class of \(25\) students, \(10\) are to be chosen for an excursion party. There are \(3\) students who decide that either all of them will join or none of them will join. In how many ways can the excursion party be chosen \(?\)

CBSE Class 11 Maths · Permutations and Combinations

Solution

👶 Simple Explanation

Simple Explanation

Imagine you are picking 10 friends for a picnic from a group of 25 classmates. Three of those classmates are best friends who always travel together — either all three come along, or none of them do. So you think of it as two separate choices. In one choice, the trio joins and you pick the remaining 7 from the other 22 classmates. In the other choice, the trio stays home and you pick all 10 from those 22 classmates. Count both choices separately, then add them up to get the total number of ways.

Answer: The excursion party can be chosen in \( {}^{22}C_{7} + {}^{22}C_{10} = 817190 \) ways.

📖 Choosing an Excursion Party with a Conditional Group

Detailed Explanation

When we choose a group of people without caring about order, we use combinations, written as \( {}^{n}C_{r} \). Here, the total selection must contain exactly 10 students out of 25, but 3 special students behave as a single unit: either all 3 come, or none of them come. Because these two possibilities cannot happen at the same time, we split the problem into two separate cases, count each case with combinations, and then ADD the results (Fundamental Principle of Counting for mutually exclusive cases). We add rather than multiply because the two cases are alternatives, not stages of the same task.

Formula Used

\( {}^{n}C_{r} = \dfrac{n!}{r!\,(n-r)!} \)

Solution

  1. Step 1: Separate the 25 students. There are 3 special students who move as a block, and the remaining \( 25 - 3 = 22 \) students who can be chosen freely. We need a total of 10 students in the party.
  2. Step 2: Case 1: All 3 special students join. Then they fill 3 of the 10 seats, so we still need \( 10 - 3 = 7 \) more students from the remaining 22. The number of ways is \[ {}^{22}C_{7}. \]
  3. Step 3: Case 2: None of the 3 special students join. Then all 10 students must be chosen from the remaining 22. The number of ways is \[ {}^{22}C_{10}. \]
  4. Step 4: Since the two cases cannot occur together, add them by the Fundamental Principle of Counting. Total number of ways is \[ {}^{22}C_{7} + {}^{22}C_{10}. \]
  5. Step 5: Compute each value. \[ {}^{22}C_{7} = \frac{22!}{7!\,15!} = 170544 \] and \[ {}^{22}C_{10} = \frac{22!}{10!\,12!} = 646646. \]
  6. Step 6: Add the two results. \[ 170544 + 646646 = 817190. \]

Final Answer

The excursion party can be chosen in \( {}^{22}C_{7} + {}^{22}C_{10} = 817190 \) ways.

Common Mistake

A common error is to multiply the two cases instead of adding them, or to forget one case entirely. Since 'all 3 join' and 'none of them join' are separate alternatives, their counts must be ADDED, not multiplied.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the structure of the problem. Out of 25 students, 3 are a special group who will either all join or all stay out. Label these 3 as the 'special trio' and the rest as the 'free pool' of \( 25 - 3 = 22 \) students. We need a party of exactly 10. — Reason: Separating the special trio from the free pool makes it easy to handle the all-or-none constraint without confusion.
  2. Step 2: Recognise that the two possible situations (trio joins vs. trio stays out) cannot happen at the same time. Because they are mutually exclusive alternatives, the total count equals the sum of the counts from each case. — Reason: The Fundamental Principle of Counting tells us to ADD counts of mutually exclusive cases, not multiply them.
  3. Step 3: Case 1 — All 3 special students join the party. They occupy 3 of the 10 seats, so we still need \( 10 - 3 = 7 \) more students chosen freely from the 22 remaining students. The number of ways for this case is \[ {}^{22}C_{7}. \] — Reason: Since order does not matter in forming a party, we use combinations to count the selections.
  4. Step 4: Case 2 — None of the 3 special students joins. All 10 members of the party must then come from the 22 free-pool students. The number of ways for this case is \[ {}^{22}C_{10}. \] — Reason: Again, combinations are appropriate because we are selecting a group, not arranging people in order.
  5. Step 5: Compute \( {}^{22}C_{7} \). Using the formula: \[ {}^{22}C_{7} = \frac{22!}{7! \times 15!} = 170544. \] — Reason: Evaluating each combination value separately before adding keeps the arithmetic organised and error-free.
  6. Step 6: Compute \( {}^{22}C_{10} \). Using the formula: \[ {}^{22}C_{10} = \frac{22!}{10! \times 12!} = 646646. \] — Reason: This gives the count for Case 2, which we will now add to the count for Case 1.
  7. Step 7: Add the two case counts to get the total number of ways. \[ {}^{22}C_{7} + {}^{22}C_{10} = 170544 + 646646 = 817190. \] — Reason: Since the two cases are mutually exclusive alternatives (not sequential stages), we add to find the overall number of valid selections.

Final Answer

The excursion party can be chosen in \( {}^{22}C_{7} + {}^{22}C_{10} = 817190 \) ways.

Common Mistake

One common mistake: Students multiply \( {}^{22}C_{7} \times {}^{22}C_{10} \) instead of adding them, confusing mutually exclusive alternatives (which require addition) with independent sequential stages (which require multiplication).

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Remaining students (excluding 3 special): \( 25 - 3 = 22 \). Party size: 10.
  2. Step 2: Case 1 (all 3 special included): choose \( 10 - 3 = 7 \) from 22, giving \( {}^{22}C_{7} = 170544 \). Case 2 (none of 3 special): choose all 10 from 22, giving \( {}^{22}C_{10} = 646646 \).
  3. Step 3: Total \( = {}^{22}C_{7} + {}^{22}C_{10} = 170544 + 646646 = 817190 \).

Answer: The excursion party can be chosen in \( {}^{22}C_{7} + {}^{22}C_{10} = 817190 \) ways.

➕ More Examples

More Examples

Example 1

Question: A committee of 8 members is to be formed from 20 volunteers. Among these volunteers, there is a group of 4 friends who have decided that either all 4 of them will be on the committee or none of them will. In how many ways can the committee be formed?

Solution: Let the group of 4 friends be called the special group. There are two cases. Case 1: All 4 friends are included in the committee. Since all 4 special friends are already chosen, we need to select the remaining \( 8 - 4 = 4 \) members from the remaining \( 20 - 4 = 16 \) volunteers. Number of ways in Case 1: \[ {}^{16}C_{4} = \frac{16!}{4! \cdot 12!} = \frac{16 \times 15 \times 14 \times 13}{4 \times 3 \times 2 \times 1} = \frac{43680}{24} = 1820 \] Case 2: None of the 4 friends is included in the committee. All 8 members must be chosen from the remaining \( 20 - 4 = 16 \) volunteers. Number of ways in Case 2: \[ {}^{16}C_{8} = \frac{16!}{8! \cdot 8!} = 12870 \] Total number of ways: \[ {}^{16}C_{4} + {}^{16}C_{8} = 1820 + 12870 = 14690 \]

Answer: 14690 ways

Example 2

Question: From a group of 18 athletes, a team of 6 is to be selected for a tournament. Three of the athletes are siblings who have decided that they will either all be part of the team or none of them will participate. In how many ways can the team be selected?

Solution: Let the 3 siblings form the special group. We consider two cases. Case 1: All 3 siblings are included in the team. Since all 3 siblings are already selected, we choose the remaining \( 6 - 3 = 3 \) members from the other \( 18 - 3 = 15 \) athletes. Number of ways in Case 1: \[ {}^{15}C_{3} = \frac{15!}{3! \cdot 12!} = \frac{15 \times 14 \times 13}{3 \times 2 \times 1} = \frac{2730}{6} = 455 \] Case 2: None of the 3 siblings is included in the team. All 6 members must be chosen from the remaining \( 18 - 3 = 15 \) athletes. Number of ways in Case 2: \[ {}^{15}C_{6} = \frac{15!}{6! \cdot 9!} = \frac{15 \times 14 \times 13 \times 12 \times 11 \times 10}{6 \times 5 \times 4 \times 3 \times 2 \times 1} = \frac{3603600}{720} = 5005 \] Total number of ways: \[ {}^{15}C_{3} + {}^{15}C_{6} = 455 + 5005 = 5460 \]

Answer: 5460 ways

🎯 Try a Similar Question

Try a Similar Question

Question: From a group of 20 students, 8 are to be selected for a science quiz team. There are 4 students who decide that either all of them will join the team or none of them will join. In how many ways can the quiz team be selected?

Solution

  1. Step 1: Understand the Condition: There are 20 students in total and 8 are to be selected. Among them, 4 students have a condition: either all 4 join or none of them joins. So we consider two separate cases.
  2. Step 2: Case 1 — All 4 Conditional Students Join: If all 4 conditional students join the team, then 4 spots are already filled. We need to choose the remaining \( 8 - 4 = 4 \) students from the remaining \( 20 - 4 = 16 \) students. The number of ways for this case is \( {}^{16}C_{4} \).
  3. Step 3: Evaluate Case 1: \[ {}^{16}C_{4} = \frac{16!}{4! \cdot 12!} = \frac{16 \times 15 \times 14 \times 13}{4 \times 3 \times 2 \times 1} = \frac{43680}{24} = 1820 \]
  4. Step 4: Case 2 — None of the 4 Conditional Students Join: If none of the 4 conditional students joins, all 8 members must be chosen from the remaining \( 20 - 4 = 16 \) students. The number of ways for this case is \( {}^{16}C_{8} \).
  5. Step 5: Evaluate Case 2: \[ {}^{16}C_{8} = \frac{16!}{8! \cdot 8!} = \frac{16 \times 15 \times 14 \times 13 \times 12 \times 11 \times 10 \times 9}{8!} = \frac{518918400}{40320} = 12870 \]
  6. Step 6: Apply the Addition Principle: Since the two cases are mutually exclusive, the total number of ways to select the quiz team is the sum of the two cases: \[ {}^{16}C_{4} + {}^{16}C_{8} = 1820 + 12870 = 14690 \]

Answer: The quiz team can be selected in \( {}^{16}C_{4} + {}^{16}C_{8} = 1820 + 12870 = 14690 \) ways.

Everything you get with Solver7

More questions in Permutations and Combinations