The number of ways of arranging the letters o | vedclass

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

Question

(C) The word $BANANA$ contains $6$ letters: $A, A, A, B, N, N$.Total arrangements of $BANANA = \frac{6!}{3!2!1!} = \frac{720}{6 	imes 2} = 60$.To fin

Vedclass · Accepted Answer

$40$

Vedclass · Answer

(C) The word $BANANA$ contains $6$ letters: $A, A, A, B, N, N$.Total arrangements of $BANANA = \frac{6!}{3!2!1!} = \frac{720}{6 	imes 2} = 60$.To find the number of arrangements where the two $N$s do not come together,we subtract the arrangements where the two $N$s are together from the total arrangements.Treat the two $N$s as a single unit $(NN)$. Now we have $5$ units: $A, A, A, B, (NN)$.Arrangements with $N$s together $= \frac{5!}{3!1!1!} = \frac{120}{6} = 20$.Number of ways where $N$s do not come together $= 60 - 20 = 40$.

The number of ways of arranging the letters of the word $BANANA$ so that the two $N$s do not come together is:

Similar Questions

Compute $\frac{7!}{5!}$

The number of permutations by taking all letters and keeping the vowels of the word $COMBINE$ in the odd places is

All possible numbers are formed using the digits $1, 1, 2, 2, 2, 2, 3, 4, 4$ taken all at a time. The number of such numbers in which the odd digits occupy even places is

In how many ways can $6$ examination papers be arranged so that the best and the worst papers are never together?

Ten persons,amongst whom are $A, B$ and $C$,are to speak at a function. The number of ways in which it can be done if $A$ wants to speak before $B$ and $B$ wants to speak before $C$ is:

Vedclass Test Series

Exam Paper Generator

Online Exam Module