
Prove that only 1422 different four letter words can be formed out of the letters of the word INEFFECTIVE.
Answer
605.1k+ views
Hint: We can observe that the word INEFFECTIVE has 4 different letters, namely N, C, T and V, i.e. 3 E, 2 I and 2 F. So we will take 4 different cases to form a four letter word from these letters. In the first case we will take all 4 different letters, in the second case we will take 2 same and 2 different letters, in the third case we will take 2 same and 2 same letters and the last case in which we will take 3 same and 1 different letters.
Complete step-by-step answer:
We have been given the word INEFFECTIVE.
We can observe that the word INEFFECTIVE has 4 different letters, namely N, C, T and V, i.e. 3E, 2I and 2F.
Now, we will take the first case in which all the letters of the four letter words are different.
Then the number of words would be as follows:
\[\begin{align}
& ^{7}{{C}_{4}}\times 4!=\dfrac{7!}{\left( 7-4 \right)!4!}\times 4! \\
& =\dfrac{7!}{\left( 7-4 \right)!}=\dfrac{7!}{3!}=\dfrac{7\times 6\times 5\times 4\times 3!}{3!} \\
& =7\times 6\times 5\times 4=840 \\
\end{align}\]
Since we have 7 different letters E, I, F, N, C, T and V so we will select and arrange 4 letters among these.
Now, we will take the second case in which 2 letters are the same and the other two letters are different from the four letter words.
Then the number of words would be as follows:
\[\begin{align}
& ^{3}{{C}_{1}}{{\times }^{6}}{{C}_{2}}\times \dfrac{4!}{2!}=3!\times \dfrac{6!}{\left( 6-2 \right)!\times 2!}\times \dfrac{4!}{2!} \\
& =3!\times \dfrac{6!}{4!\times 2!}\times \dfrac{4!}{2!} \\
& =3\times 2\times 1\times \dfrac{6\times 5\times 4\times 3\times 2!}{2!}\times \dfrac{4\times 3\times 2!}{2!} \\
& =6\times 360\times 12=540 \\
\end{align}\]
Since we have 3 sets in which 2 letters are the same, so we have to choose any one from them and 6 letters are there which we choose 2 letters and arrange all the 4 letters keeping in mind 2 letters are the same. So we will divide it by 2.
Now we will take the third case in which 2 letters are of the same kind and the other 2 letters are of the same kind of the four letter words. We can also say that in this case, all letters of the word are the same.
Then, the number of words would be as follows:
\[\begin{align}
& ^{3}{{C}_{2}}\times \dfrac{4!}{2!\times 2!}=\dfrac{3!}{\left( 3-2 \right)!2!}\times \dfrac{4!}{2!\times 2!} \\
& =\dfrac{3!}{1\times 2!}\times \dfrac{4!}{2!\times 2!}=\dfrac{3\times 2!}{2!}\times \dfrac{4\times 3\times 2!}{2!\times 2\times 1} \\
& =3\times \dfrac{12}{2}=3\times 6=18 \\
\end{align}\]
Since we have 3 sets of letters in which at least 2 letters are of the same kind, so we will have to select 2 sets from them and arrange it. Also the 2 sets have the same letters so we will divide it by \[2!\times 2!\].
Once again we will take the fourth case in which there are 3 same letters and 1 different letter of the fourth letter word.
Then the number of words would be as follows:
\[\begin{align}
& ^{1}{{C}_{1}}{{\times }^{6}}{{C}_{1}}\times \dfrac{4!}{3!}=1\times 6\times \dfrac{4\times 3!}{3!} \\
& =1\times 6\times 4=24 \\
\end{align}\]
Since there is one set in which all 3 are the same letters and 6 are different letters from which we select 1 letter and arrange all the four letters.
Hence, total number of words \[=840+540+18+24=1422\].
Hence it is proved that only 1422 different words that can be formed from the letters of the word INEFFECTIVE.
Note: Be careful while calculating the calculation part as there is a chance of multiplication error. Also remember that permutation means arrangement of things, the order of things is considered whereas combination means selection of things, the order of things has no importance.
Complete step-by-step answer:
We have been given the word INEFFECTIVE.
We can observe that the word INEFFECTIVE has 4 different letters, namely N, C, T and V, i.e. 3E, 2I and 2F.
Now, we will take the first case in which all the letters of the four letter words are different.
Then the number of words would be as follows:
\[\begin{align}
& ^{7}{{C}_{4}}\times 4!=\dfrac{7!}{\left( 7-4 \right)!4!}\times 4! \\
& =\dfrac{7!}{\left( 7-4 \right)!}=\dfrac{7!}{3!}=\dfrac{7\times 6\times 5\times 4\times 3!}{3!} \\
& =7\times 6\times 5\times 4=840 \\
\end{align}\]
Since we have 7 different letters E, I, F, N, C, T and V so we will select and arrange 4 letters among these.
Now, we will take the second case in which 2 letters are the same and the other two letters are different from the four letter words.
Then the number of words would be as follows:
\[\begin{align}
& ^{3}{{C}_{1}}{{\times }^{6}}{{C}_{2}}\times \dfrac{4!}{2!}=3!\times \dfrac{6!}{\left( 6-2 \right)!\times 2!}\times \dfrac{4!}{2!} \\
& =3!\times \dfrac{6!}{4!\times 2!}\times \dfrac{4!}{2!} \\
& =3\times 2\times 1\times \dfrac{6\times 5\times 4\times 3\times 2!}{2!}\times \dfrac{4\times 3\times 2!}{2!} \\
& =6\times 360\times 12=540 \\
\end{align}\]
Since we have 3 sets in which 2 letters are the same, so we have to choose any one from them and 6 letters are there which we choose 2 letters and arrange all the 4 letters keeping in mind 2 letters are the same. So we will divide it by 2.
Now we will take the third case in which 2 letters are of the same kind and the other 2 letters are of the same kind of the four letter words. We can also say that in this case, all letters of the word are the same.
Then, the number of words would be as follows:
\[\begin{align}
& ^{3}{{C}_{2}}\times \dfrac{4!}{2!\times 2!}=\dfrac{3!}{\left( 3-2 \right)!2!}\times \dfrac{4!}{2!\times 2!} \\
& =\dfrac{3!}{1\times 2!}\times \dfrac{4!}{2!\times 2!}=\dfrac{3\times 2!}{2!}\times \dfrac{4\times 3\times 2!}{2!\times 2\times 1} \\
& =3\times \dfrac{12}{2}=3\times 6=18 \\
\end{align}\]
Since we have 3 sets of letters in which at least 2 letters are of the same kind, so we will have to select 2 sets from them and arrange it. Also the 2 sets have the same letters so we will divide it by \[2!\times 2!\].
Once again we will take the fourth case in which there are 3 same letters and 1 different letter of the fourth letter word.
Then the number of words would be as follows:
\[\begin{align}
& ^{1}{{C}_{1}}{{\times }^{6}}{{C}_{1}}\times \dfrac{4!}{3!}=1\times 6\times \dfrac{4\times 3!}{3!} \\
& =1\times 6\times 4=24 \\
\end{align}\]
Since there is one set in which all 3 are the same letters and 6 are different letters from which we select 1 letter and arrange all the four letters.
Hence, total number of words \[=840+540+18+24=1422\].
Hence it is proved that only 1422 different words that can be formed from the letters of the word INEFFECTIVE.
Note: Be careful while calculating the calculation part as there is a chance of multiplication error. Also remember that permutation means arrangement of things, the order of things is considered whereas combination means selection of things, the order of things has no importance.
Recently Updated Pages
Which cell organelles are present in white blood C class 11 biology CBSE

What is the molecular geometry of BrF4 A square planar class 11 chemistry CBSE

How can you explain that CCl4 has no dipole moment class 11 chemistry CBSE

Which will undergo SN2 reaction fastest among the following class 11 chemistry CBSE

The values of mass m for which the 100 kg block does class 11 physics CBSE

Why are voluntary muscles called striated muscles class 11 biology CBSE

Trending doubts
One Metric ton is equal to kg A 10000 B 1000 C 100 class 11 physics CBSE

Discuss the various forms of bacteria class 11 biology CBSE

Explain zero factorial class 11 maths CBSE

State the laws of reflection of light

Difference Between Prokaryotic Cells and Eukaryotic Cells

Show that total energy of a freely falling body remains class 11 physics CBSE

