How many distinct words can be formed using t | vedclass

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

Question

(C) The word $ARRANGE$ contains $7$ letters: $A, R, R, A, N, G, E$. Here,$A$ appears $2$ times,$R$ appears $2$ times,and $N, G, E$ appear $1$ time eac

Vedclass · Accepted Answer

$900$

Vedclass · Answer

(C) The word $ARRANGE$ contains $7$ letters: $A, R, R, A, N, G, E$. Here,$A$ appears $2$ times,$R$ appears $2$ times,and $N, G, E$ appear $1$ time each. Total number of arrangements = $\frac{7!}{2! 	imes 2!} = \frac{5040}{4} = 1260$. To find the number of arrangements where two $A$'s do not occur together,we use the gap method. First,arrange the remaining letters $R, R, N, G, E$ in $\frac{5!}{2!} = \frac{120}{2} = 60$ ways. These $5$ letters create $6$ gaps (including ends): $\_ R \_ R \_ N \_ G \_ E \_$. We need to place $2$ $A$'s in these $6$ gaps. The number of ways to do this is $^6C_2 = \frac{6 	imes 5}{2} = 15$. Total arrangements where $A$'s are not together = $60 	imes 15 = 900$.

How many distinct words can be formed using the letters of the word $ARRANGE$ such that the two $A$'s do not occur together?

Similar Questions

The number of integers greater than $3000$ that can be formed by using any number of digits from the set $\{0, 1, 2, 3, 4, 5\}$ without repetition is:

How many words,with or without meaning,can be formed using the letters of the word $MONDAY$,assuming that no letter is repeated,if all letters are used but the first letter is a vowel?

Numbers greater than $1000$ but not greater than $4000$ which can be formed with the digits $0, 1, 2, 3, 4$ (repetition of digits is allowed),are

Six objects $O_1$ to $O_6$ are arranged one on top of the other. In how many ways can these be arranged such that $O_1$ and $O_2$ are the $2$ bottom-most objects?

How many $3$-digit even numbers can be formed using the digits $1, 2, 3, 4, 6, 7$,if no digit is repeated?

Vedclass Test Series

Exam Paper Generator

Online Exam Module