5
$\begingroup$

I am currently taking a course on Discrete Mathematics. In that while solving this problem am bit confused with the method of solving the following problem.

Problem: How many arrangements are there of the letters TALLAHASSEE which have no adjacent A's?

I can find the total number of permutations. But How to find the total no of permutations of adjacent A's?

so that, my answer will be..

Answer = total number of all permutations - total number of permutations of adjacent A's

  • 0
    Find the total permutations, then subtract from it the number of permutations with adjacent As.2011-10-18

3 Answers 3