Question
Question: In how many ways 7 students can be selected for a math expo from 8 students of \({11^{th}}\) standar...
In how many ways 7 students can be selected for a math expo from 8 students of 11th standard, 6 students of 10th and 4 students of 9th standard, selecting at least 2 students from each class.
Solution
Let's say two students A and B are selected from class 9th. Selecting A and then B or selection B and then A, both are the same. This means the order of selecting students for a group does not matter. Thus, use combinations to find a number of ways of selecting students for the given question.
The number of combinations of n different things taken r at a time, denoted by C(n,r) , is given by
C(n,r)=r!(n−r)!n!
‘AND’ operations are substituted with ′×′, implying both combinations are selected together.
‘OR’ operations are substituted with ′+′, implying either of the one combinations is selected.
Complete step-by-step answer:
Step 1: Given that:
Total number of students selected for a math expo = 7
Number of students of 11thstandard = 8
Number of students of 10thstandard = 6
Number of students of 9th standard = 4
Condition: at least 2 students from each class.
Step 2: Types of combinations.
We can select 7 students for the math expo in either of the following ways.
2 students from the class 11th, 2 students from the class 10th, and 3 students from class 9th.
2 students from the class 11th, 3 students from the class 10th, and 2 students from class 9th.
3 students from the class 11th, 2 students from the class 10th, and 2 students from class 9th.
Step 3: Number of combinations.
Number of combinations (or ways) of selecting 7 students =C(8,2)×C(6,2)×C(4,3)+C(8,2)×C(6,3)×C(4,2)+C(8,3)×C(6,2)×C(4,2)
Final answer: Hence, in 10080 many ways 7 students can be selected for a math expo.
Note: To find the number of handshakes, number of pairs, and selecting team members, always combinations are used.
Another way of calculating the number of arrangements is permutations, denoted by P(n,r) .
The number of permutation of n different objects taken r at a time, where 0<r⩽nand the objects do not repeat is n(n−1)(n−2)...(n−r+1), which is denoted by P(n,r).
P(n,r)=(n−r)!n!
In permutations, the order of selection is important.
n!=n(n−1)!
The notation n! represents the product of first n natural numbers,
i.e. the product 1×2×3×...×(n−1)×n=n!.
0!=1 1!=1 2!=2×1 3!=3×2×1