The number of permutations of the letters of the word INDEPENDENCE taken 4 at a time so that all the 4 are different is
A.24
B.120
C.240
D.360
Answer
Verified
466.5k+ views
Hint: Here, we will use the selection that all the 4 are different using the combinations
\[{}^n{C_r} = \dfrac{{\left. {\underline {\,
n \,}}\! \right| }}{{\left. {\underline {\,
r \,}}\! \right| \cdot \left. {\underline {\,
{n - r} \,}}\! \right| }}\], where \[n\] is the number of items, and \[r\] represents the number of items being chosen. Then simplify to find the required value.
Complete step-by-step answer:
We are given that the word is INDEPENDENCE.
We have 1 I’s, 3 N’s, 2 D’s, 4 E’s, 1 P’s and 1 C’s from the given word.
So, we know that there are four different letters in the given word, so we have \[\left. {\underline {\,
4 \,}}\! \right| \].
We will find the selection that all the 4 are different using the combinations
\[{}^n{C_r} = \dfrac{{\left. {\underline {\,
n \,}}\! \right| }}{{\left. {\underline {\,
r \,}}\! \right| \cdot \left. {\underline {\,
{n - r} \,}}\! \right| }}\], where \[n\] is the number of items, and \[r\] represents the number of items being chosen.
Here, there are 8 teams and each game is played by 2 teams, so we have
\[n = 6\]
\[r = 4\]
Substituting these values of \[n\] and \[r\] in \[{}^n{C_r} = \dfrac{{\left. {\underline {\,
n \,}}\! \right| }}{{\left. {\underline {\,
r \,}}\! \right| \cdot \left. {\underline {\,
{n - r} \,}}\! \right| }}\], we get
\[
{}^6{C_4} = \dfrac{{\left. {\underline {\,
6 \,}}\! \right| }}{{\left. {\underline {\,
4 \,}}\! \right| \cdot \left. {\underline {\,
{6 - 4} \,}}\! \right| }} \\
= \dfrac{{\left. {\underline {\,
6 \,}}\! \right| }}{{\left. {\underline {\,
4 \,}}\! \right| \cdot \left. {\underline {\,
2 \,}}\! \right| }} \\
= \dfrac{{6 \cdot 5 \cdot \left. {\underline {\,
4 \,}}\! \right| }}{{\left. {\underline {\,
4 \,}}\! \right| \cdot \left. {\underline {\,
2 \,}}\! \right| }} \\
= \dfrac{{6 \cdot 5}}{2} \\
= 15 \\
\]
Then we will multiply the above value with \[\left. {\underline {\,
4 \,}}\! \right| \] to find the total number of ways, we get
\[
= 15 \times \left. {\underline {\,
4 \,}}\! \right| \\
= 15 \times 4 \times 3 \times 2 \times 1 \\
= 360 \\
\]
Therefore, the total number of games played is 360.
Hence, the option D is correct.
Note: We will divide the obtained probabilities of the total ways for selecting by the ways such that no constraints on quantity, so not multiply them. Here, students must take care while simplifying the conditions given in the question into the combinations. Some students use the formula of permutation, \[{}^n{P_r} = \dfrac{{n!}}{{\left( {n - r} \right)!}}\] instead of combinations is \[{}^n{C_r} = \dfrac{{\left. {\underline {\,
n \,}}\! \right| }}{{\left. {\underline {\,
r \,}}\! \right| \cdot \left. {\underline {\,
{n - r} \,}}\! \right| }}\], where \[n\] is the number of items, and \[r\] represents the number of items being chosen, which is wrong.
\[{}^n{C_r} = \dfrac{{\left. {\underline {\,
n \,}}\! \right| }}{{\left. {\underline {\,
r \,}}\! \right| \cdot \left. {\underline {\,
{n - r} \,}}\! \right| }}\], where \[n\] is the number of items, and \[r\] represents the number of items being chosen. Then simplify to find the required value.
Complete step-by-step answer:
We are given that the word is INDEPENDENCE.
We have 1 I’s, 3 N’s, 2 D’s, 4 E’s, 1 P’s and 1 C’s from the given word.
So, we know that there are four different letters in the given word, so we have \[\left. {\underline {\,
4 \,}}\! \right| \].
We will find the selection that all the 4 are different using the combinations
\[{}^n{C_r} = \dfrac{{\left. {\underline {\,
n \,}}\! \right| }}{{\left. {\underline {\,
r \,}}\! \right| \cdot \left. {\underline {\,
{n - r} \,}}\! \right| }}\], where \[n\] is the number of items, and \[r\] represents the number of items being chosen.
Here, there are 8 teams and each game is played by 2 teams, so we have
\[n = 6\]
\[r = 4\]
Substituting these values of \[n\] and \[r\] in \[{}^n{C_r} = \dfrac{{\left. {\underline {\,
n \,}}\! \right| }}{{\left. {\underline {\,
r \,}}\! \right| \cdot \left. {\underline {\,
{n - r} \,}}\! \right| }}\], we get
\[
{}^6{C_4} = \dfrac{{\left. {\underline {\,
6 \,}}\! \right| }}{{\left. {\underline {\,
4 \,}}\! \right| \cdot \left. {\underline {\,
{6 - 4} \,}}\! \right| }} \\
= \dfrac{{\left. {\underline {\,
6 \,}}\! \right| }}{{\left. {\underline {\,
4 \,}}\! \right| \cdot \left. {\underline {\,
2 \,}}\! \right| }} \\
= \dfrac{{6 \cdot 5 \cdot \left. {\underline {\,
4 \,}}\! \right| }}{{\left. {\underline {\,
4 \,}}\! \right| \cdot \left. {\underline {\,
2 \,}}\! \right| }} \\
= \dfrac{{6 \cdot 5}}{2} \\
= 15 \\
\]
Then we will multiply the above value with \[\left. {\underline {\,
4 \,}}\! \right| \] to find the total number of ways, we get
\[
= 15 \times \left. {\underline {\,
4 \,}}\! \right| \\
= 15 \times 4 \times 3 \times 2 \times 1 \\
= 360 \\
\]
Therefore, the total number of games played is 360.
Hence, the option D is correct.
Note: We will divide the obtained probabilities of the total ways for selecting by the ways such that no constraints on quantity, so not multiply them. Here, students must take care while simplifying the conditions given in the question into the combinations. Some students use the formula of permutation, \[{}^n{P_r} = \dfrac{{n!}}{{\left( {n - r} \right)!}}\] instead of combinations is \[{}^n{C_r} = \dfrac{{\left. {\underline {\,
n \,}}\! \right| }}{{\left. {\underline {\,
r \,}}\! \right| \cdot \left. {\underline {\,
{n - r} \,}}\! \right| }}\], where \[n\] is the number of items, and \[r\] represents the number of items being chosen, which is wrong.
Recently Updated Pages
Master Class 11 English: Engaging Questions & Answers for Success
Master Class 11 Computer Science: Engaging Questions & Answers for Success
Master Class 11 Maths: Engaging Questions & Answers for Success
Master Class 11 Social Science: Engaging Questions & Answers for Success
Master Class 11 Economics: Engaging Questions & Answers for Success
Master Class 11 Business Studies: Engaging Questions & Answers for Success
Trending doubts
One Metric ton is equal to kg A 10000 B 1000 C 100 class 11 physics CBSE
The sequence of spore production in Puccinia wheat class 11 biology CBSE
Petromyzon belongs to class A Osteichthyes B Chondrichthyes class 11 biology CBSE
Comparative account of the alimentary canal and digestive class 11 biology CBSE
Lassaignes test for the detection of nitrogen will class 11 chemistry CBSE
The type of inflorescence in Tulsi a Cyanthium b Hypanthodium class 11 biology CBSE