Question
In an examination of Mathematics paper, there are 20 questions of equal marks and the question paper is divided into three sections : and . A student is required to attempt total 15 questions taking at least 4 questions from each section. If section has 8 questions, section has 6 questions and section has 6 questions, then the total number of ways a student can select 15 questions is __________.
Answer: 15
Solution
Key Concepts and Formulas
- Combinations: The number of ways to choose objects from a set of distinct objects, without regard to order, is given by the binomial coefficient:
- Inclusion-Exclusion Principle (simplified): When counting the number of ways to do something with multiple conditions, we often need to consider all possible cases that satisfy the given constraints.
Step-by-Step Solution
Step 1: Identify the constraints
A student must choose 15 questions from 20, with at least 4 from each section. Section A has 8 questions, and sections B and C have 6 each.
Step 2: Enumerate all possible combinations of question selections from each section that satisfy the constraints.
Let , , and be the number of questions chosen from sections A, B, and C, respectively. We need to find all non-negative integer solutions to the equation , subject to the constraints:
We can list all such combinations:
Step 3: Calculate the number of ways to choose questions for each combination
For each combination , the number of ways to choose the questions is given by . We calculate this for each case:
- :
- :
- :
- :
- :
- :
- :
- :
Step 4: Sum the results
The total number of ways is the sum of the ways for each combination:
Common Mistakes & Tips
- Forgetting Constraints: Always double-check that each combination you consider satisfies all the given constraints (minimum number of questions from each section, and total number of questions).
- Double Counting: Ensure that you are not counting any combinations more than once. Listing them out systematically helps.
- Calculation Errors: Be careful with the factorials when calculating the binomial coefficients.
Summary
We enumerated all possible combinations of questions from each section that satisfied the given constraints, calculated the number of ways to choose questions for each combination using binomial coefficients, and then summed the results to find the total number of ways a student can select the questions.
The final answer is \boxed{11376}.