If all the letters of the word 'GANGARAM' are | vedclass

Name: Exam Paper Generator | JEE NEET Paper Generator | Vedclass
Brand: Vedclass
Rating: 5 (35 reviews)

Question

(A) The word $'GANGARAM'$ contains $8$ letters: $G, G, A, N, G, A, R, A, M$. The vowels are ${A, A, A}$ and consonants are ${G, G, N, R, M}$.Step $1$:

Vedclass · Accepted Answer

$1320$

Vedclass · Answer

(A) The word $'GANGARAM'$ contains $8$ letters: $G, G, A, N, G, A, R, A, M$. The vowels are ${A, A, A}$ and consonants are ${G, G, N, R, M}$.Step $1$: Arrange the consonants ${G, G, N, R, M}$ such that no two $'G'$ are together.Total arrangements of ${G, G, N, R, M}$ is $\frac{5!}{2!} = 60$.Arrangements where both $'G'$ are together is $4! = 24$.So,arrangements where no two $'G'$ are together is $60 - 24 = 36$.Step $2$: In these $36$ arrangements,there are $6$ gaps created (including ends) to place the vowels.We need exactly two vowels together. Let the vowels be $A_1, A_2, A_3$. We select $2$ vowels to be together as a block $(AA)$ and the third $A$ must be separate.Number of ways to select $2$ vowels out of $3$ is $^3C_2 = 3$.Treat $(AA)$ as one unit and $A$ as another unit. We have $2$ units to place in $6$ gaps.Number of ways to place these $2$ units in $6$ gaps is $^6P_2 = 30$.Total ways = $36 	imes 3 	imes 30 = 3240$.Wait,the standard approach for this specific constraint is: Total arrangements with exactly two vowels together (ignoring $G$ constraint) minus arrangements where two vowels are together $AND$ two $G$ are together.Calculation: $\frac{5!}{2!} 	imes ^6C_2 	imes 2! - 4! 	imes ^5C_2 	imes 2! = 60 	imes 15 	imes 2 - 24 	imes 10 	imes 2 = 1800 - 480 = 1320$.

If all the letters of the word $'GANGARAM'$ are arranged,then the number of words in which exactly two vowels are together but no two $'G'$ occur together is-

Similar Questions

The number of words formed from the letters of the word $RAJASTHAN$ by taking all the letters at a time in which vowels are alternate is:

Total number of $3$ letter words that can be formed from the letters of the word $'SAHARANPUR'$ is equal to

If $^nC_r = 84$,$^nC_{r-1} = 36$,and $^nC_{r+1} = 126$,then $n$ equals:

In how many ways can $n$ books be arranged in a row so that two specified books are not together?

Vedclass Test Series

Exam Paper Generator

Online Exam Module