MHB Is my solution for forming 10-letter words with restrictions correct?

  • Thread starter Thread starter evinda
  • Start date Start date
AI Thread Summary
The exercise involves calculating the number of 10-letter words that can be formed using the letters A, B, and C, with the restriction that the word cannot start or end with the same letter. The proposed solution is 3^10 - 2 * 3^9 + 3^8, which accounts for the total number of unrestricted words, subtracts cases where the first two letters are the same, and subtracts cases where the last two letters are the same, while adding back cases where both conditions overlap. The discussion confirms that the solution is correct. The final consensus validates the approach taken in the calculation.
evinda
Gold Member
MHB
Messages
3,741
Reaction score
0
Hello! (Wave)

I am given the following exercise:

How many words with $10$ lettrers can be formed with the letters $A,B,C$, when it is not allowed that the word begins or ends with two same letters.

I thought that the number of words is $$3^{10}-2 \cdot 3^9+3^8$$

because:

Number of words without restrictions: $3^{10}$

Number of words when the two first letters are the same: $3^{9}$

Number of words when the two last letters are the same: $3^{9}$

Number of words when the first two and the last two are the same: $3^{8}$Could you tell if it's right?Or am I wrong? :confused:
 
Physics news on Phys.org
I think your solution is correct.
 
Evgeny.Makarov said:
I think your solution is correct.

Nice! Thank you very much! (Clapping) (Clapping)
 
Back
Top