Suppose the alphabet consists of just {a,b,c,d,e}. Consider strings of letters that show repetitions. How many 4-letter strings are there that do not contain “aa"?

foass77W

foass77W

Answered question

2021-01-19

Suppose the alphabet consists of just {a,b,c,d,e}. Consider strings of letters that show repetitions. How many 4-letter strings are there that do not contain “aa"?

Answer & Explanation

falhiblesw

falhiblesw

Skilled2021-01-20Added 97 answers

Fundamental counting principle: If the first event could occur in m ways and the second event could occur in n ways, then the number of ways that the two events could occur in sequence is mn
Solution Number of 4-letter strings
Each letter in the string has 5 possible values (a,b,c,d).
First letter: 5 ways
Second letter: 5 ways
Third letter: 5 ways
Fourth letter: 5 ways
Use the fundamental counting principle: 5555=54=625
Number of 4-letter strings containing "aa" There are three possible positions for the string aa (that is, the string is either of the form aaxx, xaax or xxaa.
Each of the letters x in the string has 5 possible values (a,b,c,d,e).
Place aa: 3 ways First letter: 5 ways Second letter: 5 ways
Use the fundamental counting principle: 355=75
Number of 4-letter strings not containing "aa" There are 625 4-letter strings and there are 75 4-letter strings containing "aa", thus there are then 62575=550 4-letter strings not containing "aa"

Do you have a similar question?

Recalculate according to your conditions!

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?