SOLVER7 Study. Nothing Else.
Miscellaneous Exercise Chapter 6 Q7

In an examination, a question paper consists of \(12\) questions divided into two parts \(i.e.,\) Part \(I\) and Part \(II,\) containing \(5\) and \(7\) questions, respectively. A student is required to attempt \(8\) questions in all, selecting at least \(3\) from each part. In how many ways can a student select the questions \(?\)

CBSE Class 11 Maths · Permutations and Combinations

Solution

👶 Simple Explanation

Simple Explanation

Imagine a student picking 8 favourite snacks from two bowls. Bowl A has 5 snacks and Bowl B has 7 snacks. The rule says pick at least 3 from each bowl. So the student can pick 3 from A and 5 from B, or 4 from A and 4 from B, or 5 from A and 3 from B. For each way of splitting, we count how many snack combinations are possible, then add all those counts together. That total gives us the answer.

Answer: The student can select the questions in \( 420 \) ways.

📖 Selecting Questions with Part-wise Restrictions

Detailed Explanation

This is a selection (choosing) problem, so order does not matter and we use combinations, denoted \( {}^{n}C_{r} \). Part I has 5 questions and Part II has 7 questions. The student must attempt 8 questions in total, with at least 3 chosen from each part. Because there is a lower limit of 3 on each part, we list all valid ways the 8 questions can be split between the two parts. For each valid split we multiply the number of ways to choose from Part I by the number of ways to choose from Part II (fundamental principle of counting), and finally we add the results of all cases (since these cases are mutually exclusive).

Formula Used

\( {}^{n}C_{r} = \dfrac{n!}{r!\,(n-r)!} \), and by the multiplication principle the ways for one case is \( {}^{5}C_{a} \times {}^{7}C_{b} \) where \( a + b = 8 \).

Solution

  1. Step 1: Let \( a \) be the number chosen from Part I (5 questions) and \( b \) from Part II (7 questions). We need \( a + b = 8 \), with \( a \ge 3 \) and \( b \ge 3 \). Also \( a \le 5 \) since Part I only has 5 questions.
  2. Step 2: Find all valid values of \( a \). Since \( a \ge 3 \) and \( b = 8 - a \ge 3 \) gives \( a \le 5 \), the allowed values are \( a = 3, 4, 5 \). This gives three cases: \( (a, b) = (3, 5),\ (4, 4),\ (5, 3) \).
  3. Step 3: Case 1: choose 3 from Part I and 5 from Part II. \[ {}^{5}C_{3} \times {}^{7}C_{5} = 10 \times 21 = 210 \]
  4. Step 4: Case 2: choose 4 from Part I and 4 from Part II. \[ {}^{5}C_{4} \times {}^{7}C_{4} = 5 \times 35 = 175 \]
  5. Step 5: Case 3: choose 5 from Part I and 3 from Part II. \[ {}^{5}C_{5} \times {}^{7}C_{3} = 1 \times 35 = 35 \]
  6. Step 6: Since the three cases are mutually exclusive, add them up. \[ 210 + 175 + 35 = 420 \]

Final Answer

The student can select the questions in \( 420 \) ways.

Common Mistake

A common error is forgetting to check the upper limit and add all valid cases. Students sometimes take only one split (like 4 and 4) or forget that Part I has just 5 questions, so \( a = 5 \) is the maximum. Missing any case gives a wrong total.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Define the variables. Let \( a \) = number of questions chosen from Part I (which has 5 questions) and \( b \) = number chosen from Part II (which has 7 questions). The total required is \( a + b = 8 \), with the constraints \( a \ge 3 \), \( b \ge 3 \), \( a \le 5 \), and \( b \le 7 \). — Reason: Setting up variables with clear constraints avoids counting invalid selections.
  2. Step 2: Find all valid pairs \( (a, b) \). Since \( b = 8 - a \ge 3 \), we get \( a \le 5 \). Combined with \( a \ge 3 \) and \( a \le 5 \), the valid values are \( a = 3, 4, 5 \), giving the pairs \( (3,\,5) \), \( (4,\,4) \), and \( (5,\,3) \). — Reason: Listing every valid split ensures no case is missed or double-counted.
  3. Step 3: Calculate the number of ways for Case 1: \( (a, b) = (3, 5) \), i.e., 3 from Part I and 5 from Part II. \[ {}^{5}C_{3} \times {}^{7}C_{5} = \frac{5!}{3!\,2!} \times \frac{7!}{5!\,2!} = 10 \times 21 = 210 \] — Reason: The multiplication principle applies because the choice from Part I is independent of the choice from Part II.
  4. Step 4: Calculate the number of ways for Case 2: \( (a, b) = (4, 4) \), i.e., 4 from Part I and 4 from Part II. \[ {}^{5}C_{4} \times {}^{7}C_{4} = \frac{5!}{4!\,1!} \times \frac{7!}{4!\,3!} = 5 \times 35 = 175 \] — Reason: Same independent-choice logic applies; each part is handled separately and the results are multiplied.
  5. Step 5: Calculate the number of ways for Case 3: \( (a, b) = (5, 3) \), i.e., 5 from Part I and 3 from Part II. \[ {}^{5}C_{5} \times {}^{7}C_{3} = \frac{5!}{5!\,0!} \times \frac{7!}{3!\,4!} = 1 \times 35 = 35 \] — Reason: Choosing all 5 questions from Part I can only happen in 1 way, while 35 ways exist to pick 3 from Part II.
  6. Step 6: Add the results of all three cases to get the total number of selections. \[ 210 + 175 + 35 = 420 \] — Reason: The three cases are mutually exclusive (a student cannot belong to two different splits at once), so the addition rule of counting applies.

Final Answer

The student can select the questions in \( 420 \) ways.

Common Mistake

One common mistake: Students forget the upper bound constraint \( a \le 5 \) and incorrectly include cases like \( (6, 2) \), or they forget the lower bound and include cases like \( (2, 6) \) where fewer than 3 questions are taken from a part.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Let \( a \) = questions from Part I (max 5), \( b \) = questions from Part II (max 7), with \( a + b = 8 \), \( a \ge 3 \), \( b \ge 3 \). Valid splits: \( (a,b) = (3,5),\ (4,4),\ (5,3) \).
  2. Step 2: Case 1: \( {}^{5}C_{3} \times {}^{7}C_{5} = 10 \times 21 = 210 \). Case 2: \( {}^{5}C_{4} \times {}^{7}C_{4} = 5 \times 35 = 175 \). Case 3: \( {}^{5}C_{5} \times {}^{7}C_{3} = 1 \times 35 = 35 \).
  3. Step 3: Total \( = 210 + 175 + 35 = 420 \).

Answer: The student can select the questions in \( 420 \) ways.

➕ More Examples

More Examples

Example 1

Question: A test paper has 15 questions divided into two sections: Section A has 6 questions and Section B has 9 questions. A student must attempt 10 questions in all, choosing at least 3 from each section. In how many ways can the student select the questions?

Solution: Section A has 6 questions and Section B has 9 questions. The student must choose 10 questions with at least 3 from Section A and at least 3 from Section B. Let the number of questions chosen from Section A be \( a \) and from Section B be \( b \). Then: \[ a + b = 10, \quad a \ge 3, \quad b \ge 3, \quad a \le 6, \quad b \le 9 \] The valid cases are: Case 1: \( a = 3,\; b = 7 \) \[ {}^{6}C_{3} \times {}^{9}C_{7} = 20 \times 36 = 720 \] Case 2: \( a = 4,\; b = 6 \) \[ {}^{6}C_{4} \times {}^{9}C_{6} = 15 \times 84 = 1260 \] Case 3: \( a = 5,\; b = 5 \) \[ {}^{6}C_{5} \times {}^{9}C_{5} = 6 \times 126 = 756 \] Case 4: \( a = 6,\; b = 4 \) \[ {}^{6}C_{6} \times {}^{9}C_{4} = 1 \times 126 = 126 \] Total number of ways: \[ 720 + 1260 + 756 + 126 = 2862 \]

Answer: 2862 ways

Example 2

Question: A committee of 7 members is to be formed from a group of 5 teachers and 8 students. The committee must include at least 2 teachers and at least 2 students. In how many ways can this be done?

Solution: There are 5 teachers and 8 students. The committee has 7 members with at least 2 teachers and at least 2 students. Let \( t \) be the number of teachers and \( s \) be the number of students. Then: \[ t + s = 7, \quad t \ge 2, \quad s \ge 2, \quad t \le 5, \quad s \le 8 \] The valid cases are: Case 1: \( t = 2,\; s = 5 \) \[ {}^{5}C_{2} \times {}^{8}C_{5} = 10 \times 56 = 560 \] Case 2: \( t = 3,\; s = 4 \) \[ {}^{5}C_{3} \times {}^{8}C_{4} = 10 \times 70 = 700 \] Case 3: \( t = 4,\; s = 3 \) \[ {}^{5}C_{4} \times {}^{8}C_{3} = 5 \times 56 = 280 \] Case 4: \( t = 5,\; s = 2 \) \[ {}^{5}C_{5} \times {}^{8}C_{2} = 1 \times 28 = 28 \] Total number of ways: \[ 560 + 700 + 280 + 28 = 1568 \]

Answer: 1568 ways

🎯 Try a Similar Question

Try a Similar Question

Question: A test paper has 14 questions divided into two sections: Section A has 6 questions and Section B has 8 questions. A student must attempt 9 questions in all, choosing at least 3 from each section. In how many ways can the student select the questions?

Solution

  1. Step 1: Identify the valid cases: The student must attempt 9 questions with at least 3 from Section A (6 questions) and at least 3 from Section B (8 questions). Let the number of questions chosen from Section A be \( a \) and from Section B be \( b \). Then \( a + b = 9 \), with \( a \ge 3 \) and \( b \ge 3 \), and also \( a \le 6 \) and \( b \le 8 \). The valid combinations are: \( (a, b) = (3, 6),\, (4, 5),\, (5, 4),\, (6, 3) \).
  2. Step 2: Count ways for Case 1 — (3 from A, 6 from B): Number of ways = \( {}^{6}C_{3} \times {}^{8}C_{6} \). Calculating: \( {}^{6}C_{3} = \frac{6!}{3! \cdot 3!} = 20 \) and \( {}^{8}C_{6} = {}^{8}C_{2} = \frac{8!}{2! \cdot 6!} = 28 \). So the number of ways = \( 20 \times 28 = 560 \).
  3. Step 3: Count ways for Case 2 — (4 from A, 5 from B): Number of ways = \( {}^{6}C_{4} \times {}^{8}C_{5} \). Calculating: \( {}^{6}C_{4} = {}^{6}C_{2} = \frac{6!}{2! \cdot 4!} = 15 \) and \( {}^{8}C_{5} = {}^{8}C_{3} = \frac{8!}{3! \cdot 5!} = 56 \). So the number of ways = \( 15 \times 56 = 840 \).
  4. Step 4: Count ways for Case 3 — (5 from A, 4 from B): Number of ways = \( {}^{6}C_{5} \times {}^{8}C_{4} \). Calculating: \( {}^{6}C_{5} = 6 \) and \( {}^{8}C_{4} = \frac{8!}{4! \cdot 4!} = 70 \). So the number of ways = \( 6 \times 70 = 420 \).
  5. Step 5: Count ways for Case 4 — (6 from A, 3 from B): Number of ways = \( {}^{6}C_{6} \times {}^{8}C_{3} \). Calculating: \( {}^{6}C_{6} = 1 \) and \( {}^{8}C_{3} = \frac{8!}{3! \cdot 5!} = 56 \). So the number of ways = \( 1 \times 56 = 56 \).
  6. Step 6: Add all cases: Total number of ways = \( 560 + 840 + 420 + 56 = 1876 \).

Answer: The student can select the questions in \( 1876 \) ways.

Everything you get with Solver7

More questions in Permutations and Combinations