Quote:
In how many ways can we rearrange the letters of the word MANANA such that no two A’s are adjacent to each other?
A. 12
B. 18
C. 24
D. 30
E. 60
Kritisood
Ans= total ways - whenever AAs are adjacent
total ways = 6!/3!2!= 60
2 AAs adjacent = 5!/2! = 30
3 AAAs adjacent. = 4!/2! = 12
total when As are adjacent = 42 - i understand here there must be overlapping cases, how to understand those and subtract the same?
KritisoodPlease note that 2AA's together is not 30
ATLEAST 2 AA adjacent will always include 3 AAA adjacent and the ordering of AAA might also come in picture so that's the problemSo, It's best to make two separate cases
1) Exactly 2A adjacent - MANANA has 3 As and 6 letters in total
AA - - - - now third A can come only on last three places and the remaining three letters can be arranged in 3!/2! ways (2N are identical) = 3*3!/2! = 9
- AA - - - now third A can come only on last two places and the remaining three letters can be arranged in 3!/2! ways (2N are identical) = 2*3!/2! = 6
- - AA - - now third A can come only on two places (first and last) and the remaining three letters can be arranged in 3!/2! ways (2N are identical) = 2*3!/2! = 6
- - - AA - now third A can come only on First two places and the remaining three letters can be arranged in 3!/2! ways (2N are identical) = 2*3!/2! = 6
- - - - AA now third A can come only on First three places and the remaining three letters can be arranged in 3!/2! ways (2N are identical) = 3*3!/2! = 92) Exactly 3A adjacent
AAA --- Total arrangements will be 4 (places for AAA) * 3!/2! = 12Final Result = 6!/(3!2!) = 60 - (9+6+6+6+9) - 12 = 12
Answer: Option A
But I won't call it the best method. It's just a method to understand the dynamics of arrangements