From all English alphabets, five letters are chosen and are arranged in alphabetical order. total nu

English

Gujarati

Hindi

6.Permutation and Combination

medium

From all the English alphabets, five letters are chosen and are arranged in alphabetical order. The total number of ways, in which the middle letter is $' M '$, is :

A$14950$

B$6084$

C$4356$

D$5148$

(JEE MAIN-2025)

Solution

$$
\begin{array}{l}
\underbrace{AB}_{12} \quad \underbrace{MN . \ldots \ldots . . . Z}_{13} \\
=\underset{\substack{\text { Selection of two } \\
\text { leter befre }}}{{ }^{12} C_2} \times \underset{\substack{\text { Selection of two } \\
\text { lefers }}}{{ }^{13} C_2}=5148
\end{array}
$$

Standard 11

Mathematics

The number of ways of dividing $52$ cards amongst four players so that three players have $17$ cards each and the fourth player just one card, is

medium

(IIT-1979)

Let $A = \left\{ {{a_1},\,{a_2},\,{a_3}…..} \right\}$ be a set containing $n$ elements. Two subsets $P$ and $Q$ of it is formed independently. The number of ways in which subsets can be formed such that $(P-Q)$ contains exactly $2$ elements, is

normal

An engineer is required to visit a factory for exactly four days during the first $15$ days of every month and it is mandatory that no two visits take place on consecutive days. Then the number of all possible ways in which such visits to the factory can be made by the engineer during 1$-15$ June $2021$ is. . . . . .

medium

(IIT-2020)

If $^{n + 1}{C_3} = 2{\,^n}{C_2},$ then $n =$

easy

How many words of $4$ consonants and $3$ vowels can be formed from $6$ consonants and $5$ vowels

easy

From all the English alphabets, five letters are chosen and are arranged in alphabetical order. The total number of ways, in which the middle letter is $' M '$, is :

Solution

Similar Questions

The number of ways of dividing $52$ cards amongst four players so that three players have $17$ cards each and the fourth player just one card, is

Let $A = \left\{ {{a_1},\,{a_2},\,{a_3}…..} \right\}$ be a set containing $n$ elements. Two subsets $P$ and $Q$ of it is formed independently. The number of ways in which subsets can be formed such that $(P-Q)$ contains exactly $2$ elements, is

If $^{n + 1}{C_3} = 2{\,^n}{C_2},$ then $n =$

How many words of $4$ consonants and $3$ vowels can be formed from $6$ consonants and $5$ vowels

Start a Free Trial Now