If x and y represent the number of arrangemen | vedclass

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

Question

(C) The word $ATRAPATRAM$ contains $10$ letters: $A(4), T(2), R(2), P(1), M(1)$.$(i)$ If all $A$'s are together,we treat the block $(AAAA)$ as one uni

Vedclass · Accepted Answer

$\frac{6!}{2!2!} 	imes 42$

Vedclass · Answer

(C) The word $ATRAPATRAM$ contains $10$ letters: $A(4), T(2), R(2), P(1), M(1)$.$(i)$ If all $A$'s are together,we treat the block $(AAAA)$ as one unit. We then have $6$ other letters plus this $1$ unit,totaling $7$ items. The number of arrangements is $x = \frac{7!}{2!2!}$.(ii) If no two $A$'s are together,we first arrange the remaining $6$ letters $(T, T, R, R, P, M)$,which can be done in $\frac{6!}{2!2!}$ ways. There are $7$ gaps created by these $6$ letters. We choose $4$ gaps for the $4$ $A$'s in $^7C_4$ ways. Thus,$y = ^7C_4 	imes \frac{6!}{2!2!}$.Therefore,$x+y = \frac{7!}{2!2!} + ^7C_4 	imes \frac{6!}{2!2!}$.$x+y = \frac{7 	imes 6!}{2!2!} + 35 	imes \frac{6!}{2!2!} = \frac{6!}{2!2!} (7 + 35) = \frac{6!}{2!2!} 	imes 42$.

If $x$ and $y$ represent the number of arrangements of the letters of the word $ATRAPATRAM$ such that $(i)$ all $A$'s are together and $(ii)$ no two $A$'s are together respectively,then $x+y$ is equal to:

Similar Questions

There are $3$ applicants for a scholarship in Physics,$5$ for Mathematics,and $4$ for Chemistry. In how many different ways can one of these scholarships be awarded?

In how many ways can $3$ letters be posted in $4$ letter boxes,if all the letters are not posted in the same letter box?

$A$ $5$-digit number $\overline{abcde}$,when multiplied by $9$,gives the $5$-digit number $\overline{edcba}$. The sum of the digits in the number is:

All possible $5$-digit numbers,each having $5$ distinct digits,are formed using the digits $\{1, 2, 3, 5, 6, 8\}$. Among them,the number of such numbers which are divisible by $3$ but not by $6$ is:

An envelope has space for at most $3$ stamps. If you are given three stamps of denomination $1$ and three stamps of denomination $a$ (where $a > 1$),what is the least positive integer for which there is no possible stamp value?

Vedclass Test Series

Exam Paper Generator

Online Exam Module