The number of different permutations of lette | vedclass

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

Question

(C) The word '$REPETITION$' consists of $10$ letters: $R, E, P, E, T, I, T, I, O, N$. The distinct letters are $R, E, P, T, I, O, N$ ($7$ distinct let

Vedclass · Accepted Answer

$1398$

Vedclass · Answer

(C) The word '$REPETITION$' consists of $10$ letters: $R, E, P, E, T, I, T, I, O, N$. The distinct letters are $R, E, P, T, I, O, N$ ($7$ distinct letters). The repeated letters are $E, T, I$ (each appearing twice). We need to form permutations of $4$ letters. The cases are: $(i)$ All $4$ letters are distinct: We choose $4$ letters from $7$ distinct letters and arrange them in $4!$ ways. Number of ways $= {}^{7}C_{4} 	imes 4! = 35 	imes 24 = 840$. (ii) $2$ letters are the same (one pair) and $2$ are distinct: We choose $1$ pair from $3$ available pairs $(E, T, I)$ and $2$ letters from the remaining $6$ distinct letters. Then we arrange them. Number of ways $= {}^{3}C_{1} 	imes {}^{6}C_{2} 	imes \frac{4!}{2!} = 3 	imes 15 	imes 12 = 540$. (iii) $2$ pairs of letters: We choose $2$ pairs from $3$ available pairs. Then we arrange them. Number of ways $= {}^{3}C_{2} 	imes \frac{4!}{2! 	imes 2!} = 3 	imes 6 = 18$. Total permutations $= 840 + 540 + 18 = 1398$. Hence,option $(C)$ is correct.

The number of different permutations of letters that can be formed by taking $4$ letters at a time from the letters of the word '$REPETITION$' is

Similar Questions

In how many ways can $4$ letters be selected and arranged from the word $MATHEMATICS$?

We are to form different words with the letters of the word $INTEGER$. Let $m_1$ be the number of words in which $I$ and $N$ are never together and $m_2$ be the number of words which begin with $I$ and end with $R$,then $m_1/m_2$ is equal to

If all the letters of the word $MASTER$ are permuted in all possible ways and the words (with or without meaning) thus formed are arranged in dictionary order,then the rank of the word $MASTER$ is

Four speakers will address a meeting where speaker $Q$ will always speak before $P$. Then,the number of ways in which the order of speakers can be prepared is

The number of arrangements of the letters of the word $ARRANGEMENT$ in which two $E$s do not occur adjacently is

Vedclass Test Series

Exam Paper Generator

Online Exam Module