A history examination is made up of $3$ set of $5$ Question each and a student must select $3$ questions from each set . How many different sets of $9$ questions can the student select ?
I am in dilemma how i can use combination formula
A history examination is made up of $3$ set of $5$ Question each and a student must select $3$ questions from each set . How many different sets of $9$ questions can the student select ?
I am in dilemma how i can use combination formula
From each of the three sets of $5$ questions, a student must select three questions.
So, yes, we can compute three sets of combinations:
$(1)$ From the first set of $5$ questions, there are $\binom 53$ ways a student may select three questions.
$(2)$ Similarly, from the second set of $5$ questions, the student must select 3 questions to answer. Again, there are $\binom 53$ ways of doing so.
$(3)$ And likewise for the third set.
$(*)$ Then, as David Mitra suggested, we need the multiplication principle to get, overall, the number of ways a student can answer questions on the test, for a total of:
$$\binom 53 \cdot \binom 53 \cdot \binom 53 \quad \text{ways of doing so}$$
HINT: Since students need to select total $9$ questions, and $3$ questions must be selected from each of $3$ sets, therefore, exactly $3$ questions from each set needs to be selected and total number of ways of doing so $={.\choose.}{.\choose.}{.\choose.}$