The number of four-lettered words that can be | vedclass

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

Question

(B) The word $MAYANK$ contains $6$ letters: $M, A, Y, A, N, K$. The distinct letters are $M, Y, N, K$ and two $A$'s.To form a $4$-letter word containi

Vedclass · Accepted Answer

$36$

Vedclass · Answer

(B) The word $MAYANK$ contains $6$ letters: $M, A, Y, A, N, K$. The distinct letters are $M, Y, N, K$ and two $A$'s.To form a $4$-letter word containing both $A$'s,we need to select $2$ more letters from the remaining $4$ distinct letters $(M, Y, N, K)$.Number of ways to select $2$ letters from $4$ is $^4C_2 = \frac{4 	imes 3}{2} = 6$.Now,we have $4$ letters: $A, A$ and two other letters (say $X, Y$).The total number of arrangements of these $4$ letters is $\frac{4!}{2!} = \frac{24}{2} = 12$.Since there are $6$ ways to choose the $2$ letters,the total number of words containing both $A$'s is $6 	imes 12 = 72$.Now,we find the number of words where both $A$'s are together. Treat $(AA)$ as one unit. We have $3$ units: $(AA), X, Y$.The number of arrangements is $3! = 6$.Since there are $6$ ways to choose the $2$ letters,the number of words where $A$'s are together is $6 	imes 6 = 36$.The number of words where $A$'s are never together is $72 - 36 = 36$.

The number of four-lettered words that can be formed from the letters of the word $MAYANK$ such that both $A$'s are included but never together,is equal to:

Similar Questions

Let $n$ be the number of ways in which $5$ boys and $5$ girls can stand in a queue such that all the girls stand consecutively. Let $m$ be the number of ways in which $5$ boys and $5$ girls can stand in a queue such that exactly four girls stand consecutively. Then the value of $\frac{m}{n}$ is

The number of integers between $1$ and $10^{10}$ (inclusive) that contain the digit $1$ is:

There are three sections in a question paper,each section containing $4$ questions. If a candidate has to answer exactly $5$ questions from this paper such that at least one question is answered from each section,then the number of ways in which a candidate can make the choice of questions is

If $n$ is an integer with $0 \leq n \leq 11$,then the minimum value of $n!(11-n)!$ is attained when a value of $n$ equals to

Vedclass Test Series

Exam Paper Generator

Online Exam Module