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
- 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.
- 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) \).
- 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 \]
- 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 \]
- 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 \]
- 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.