Permutations & Combinations
Selection from Three Sections with Minimum Constraint
nta_pyq_2024_jan
Grade 11

Question:

In an examination of Mathematics paper, there are 20 questions of equal marks and the question paper is divided into three sections: A, B and C. A student is required to attempt total 15 questions taking at least 4 questions from each section. If section A has 8 questions, section B has 6 questions and section C has 6 questions, then the total number of ways a student can select 15 questions is

Step-by-Step Solution

Key Concept: Select at least 4 from each section, total 15. After choosing 4 from each (12 total), distribute remaining 3 among sections respecting upper limits (A≤8, B≤6, C≤6). Cases for extra $(a,b,c)$: $(1,1,1),(3,0,0),(0,3,0),(0,0,3),(2,1,0)$ and permutations.
Total ways $=11376$.
Correct Answer: 11376

Master Permutations & Combinations with Mathbee

Practice this topic under real exam conditions with strict timers, or ask our AI Mentor to explain the concepts step-by-step.

Start Practicing for Free