raanan
I would be thankful if someone could point out what is wrong in my solution:
In total we have to select 4 out of 11, so its 11C4.
each of the 3 couples can be substituted within itself, so for each we have 2!=2 inner combinations.
counting out those duplicities: 11C4/(2!*2!*2!) = 41.25

Find the number of ways in which 4 letters may be selected from the word "Examination"?A. 66
B. 70
C. 136
D. 330
E. 4264
We have, 11 letters: {A, A, E, I, I, O, M, N, N, T, X};
Out of them there are 3 pairs: {A, A}, {I, I} and {N, N}.
So, # of distinct letters is 8: {A, E, I, I, O, M, N, N, T, X}
As pointed out, there are 3 different cases possible.
{abcd} - all 4 letters are distinct: \(C^4_8=70\);
{aabc} - two letters are alike and other two are distinct: \(C^1_3*C^2_7=63\) (\(C^1_3\) is a # of ways to choose which two letters will be alike from 3 pairs and \(C^2_7\) # of ways to choose other two distinct letters from 7 letters which are left);
{aabb} - two letters are alike and other two letters are also alike: \(C^2_3=3\) (\(C^3_3\) is a # of ways of choosing two pairs of alike letter from 3 such pairs);
Total=70+63+3=136.
Answer: C.
So, as you can see you can not just pick 4 letters with \(C^4_{11}\) and then divide it by some factorial as there are 3
different cases possible and each has its own factorial correction.
Hope it's clear.
If the ques states that no repititions are possible, we will divide by factorial of no of time the letters are repeated to get the answer?Am i correct?Kindly clarify