A competion admist 22 different contestants, the participants are divided into 2 groups 12 in group A and 10 in group B a)In how many ways can the jury rank 6 contestants(disgrading groups) b)In how many ways can jury rank 6 contestants if the first 3 belong to one group and the last 3 belong to other
Permutations and Combinations
If there are 5 dishes, they can be relished in any order at a time. In permutation, it should be in a particular order. In combination, the order does not matter. Take 3 letters a, b, and c. The possible ways of pairing any two letters are ab, bc, ac, ba, cb and ca. It is in a particular order. So, this can be called the permutation of a, b, and c. But if the order does not matter then ab is the same as ba. Similarly, bc is the same as cb and ac is the same as ca. Here the list has ab, bc, and ac alone. This can be called the combination of a, b, and c.
Counting Theory
The fundamental counting principle is a rule that is used to count the total number of possible outcomes in a given situation.
A competion admist 22 different contestants, the participants are divided into 2 groups 12 in group A and 10 in group B
a)In how many ways can the jury rank 6 contestants(disgrading groups)
b)In how many ways can jury rank 6 contestants if the first 3 belong to one group and the last 3 belong to other
Step by step
Solved in 2 steps
