There are 3 sections in a question paper and each section contains 5 questions. A candidate has to answer a total of 5 questions, choosing at least one question from each section. Then the number of ways, in which the candidate can choose the questions, is:
Let the three sections be labelled Section I, Section II and Section III. If we denote by the number of questions chosen from Section I, Section II and Section III respectively, then
because a total of five questions have to be answered, and
because the candidate must attempt at least one question from each section. We now list all integer triples that satisfy these two conditions.
First we rewrite the condition under the restriction . If we set for , then and
Hence we need the non-negative solutions of . Using the stars-and-bars formula, the total number of such solutions is
and they are explicitly
$
Translating back by adding 1 to every component, the admissible triples are
$
So there are exactly two distinct types of distributions:
Type A. One section contributes 3 questions and each of the other two contributes 1 question patterns , ,
Type B. Two sections contribute 2 questions each and the remaining one contributes 1 question patterns , ,
We now count the actual choices of questions for every pattern.
Type A: pattern (3,1,1). From the section where 3 questions are to be chosen, the number of ways is From each section where 1 question is to be chosen, the number of ways is Hence, for this pattern, the number of ways is
$
The same count applies to each of the 3 permutations of (3,1,1), so the total for Type A is
Type B: pattern (2,2,1). Here the number of ways is
$
Again there are 3 permutations of (2,2,1), so the total for Type B is
Adding the two types together, the grand total number of permissible question selections is
Hence, the correct answer is Option D.
Tagged Combinations and selections with conditions. Machine-assigned, so read it as a strong shortlist rather than a verdict.