Suppose the alphabet consists of just {a,b,c,d,e}. How many 4-letter strings are there that do not have “aa” in the middle?
I so far answered: We assume that a word could have multiple same letters.
Since the word is only four letters, a can not be in the second and third position.
We look at this as a can be in either the second or third position.
Accoringly: (all combos with no a in second or third position) + all combos with a in second but not third + a in third but not second.
[C(5,1)*C(4,1)*C(4,1)*C(5,1)] + [C(5,1)*C(1,1)*C(4,1)*C(5,1)] + [C(5,1)*C(4,1)*C(1,1)*C(5,1)] =400+100+100 =600
Therefore, there are 600 4-letter strings of (a,b,c,d,e) that don't have aa in the middle.
Would that be correct, or incorrect in this case!
Thanks, A
aaebcount as "havingaain the middle", or is it only strings likecaae? – hmakholm left over Monica Aug 08 '16 at 19:05C(5,1)*C(4,1)*C(4,1)*C(5,1)when you could instead write $5\cdot 4\cdot 4\cdot 5$. You don't always have to think in terms of binomial coefficients, regular numbers are useful too and more compact to say aloud and write. – JMoravitz Aug 08 '16 at 19:09