If all the letters of the word $'GANGARAM'$ be arranged, then number of words in which exactly two vowels are together but no two $'G'$ occur together is-
If all the letters of the word $'GANGARAM'$ be arranged, then number of words in which exactly two vowels are together but no two $'G'$ occur together is-
- A
$1320$
- B
$1560$
- C
$1800$
- D
$1740$
Similar Questions
Ten persons, amongst whom are $A, B$ and $C$ 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
Ten persons, amongst whom are $A, B$ and $C$ 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
In the $13$ cricket players $4$ are bowlers, then how many ways can form a cricket team of $11$ players in which at least $2$ bowlers included
In the $13$ cricket players $4$ are bowlers, then how many ways can form a cricket team of $11$ players in which at least $2$ bowlers included
How many chords can be drawn through $21$ points on a circle?
How many chords can be drawn through $21$ points on a circle?
The number of onto functions $f$ from $\{1, 2, 3, …, 20\}$ only $\{1, 2, 3, …, 20\}$ such that $f(k)$ is a multiple of $3$, whenever $k$ is a multiple of $4$, is
The number of onto functions $f$ from $\{1, 2, 3, …, 20\}$ only $\{1, 2, 3, …, 20\}$ such that $f(k)$ is a multiple of $3$, whenever $k$ is a multiple of $4$, is
- [JEE MAIN 2019]
$^n{C_r}{ + ^n}{C_{r - 1}}$ is equal to
$^n{C_r}{ + ^n}{C_{r - 1}}$ is equal to