A total number of words which can be formed out of the letters $a,\;b,\;c,\;d,\;e,\;f$ taken $3$ together such that each word contains at least one vowel, is
A total number of words which can be formed out of the letters $a,\;b,\;c,\;d,\;e,\;f$ taken $3$ together such that each word contains at least one vowel, is
- A
$72$
- B
$48$
- C
$96$
- D
None of these
Similar Questions
What is the number of ways of choosing $4$ cards from a pack of $52$ playing cards? In how many of these
four cards are of the same suit,
What is the number of ways of choosing $4$ cards from a pack of $52$ playing cards? In how many of these
four cards are of the same suit,
Let $n(A) = 3, \,n(B) = 3$ (where $n(S)$ denotes number of elements in set $S$), then number of subsets of $(A \times B)$ having odd number of elements, is-
Let $n(A) = 3, \,n(B) = 3$ (where $n(S)$ denotes number of elements in set $S$), then number of subsets of $(A \times B)$ having odd number of elements, is-
The numbers of permutations of $n$ things taken $r$ at a time, when $p$ things are always included, is
The numbers of permutations of $n$ things taken $r$ at a time, when $p$ things are always included, is
How many different words can be formed by jumbling the letters in the word $MISSISSIPPI$ in which no two $S$ are adjacent $?$
How many different words can be formed by jumbling the letters in the word $MISSISSIPPI$ in which no two $S$ are adjacent $?$
- [AIEEE 2008]
If $2 \times {}^n{C_5} = 9\,\, \times \,\,{}^{n - 2}{C_5}$, then the value of $n$ will be
If $2 \times {}^n{C_5} = 9\,\, \times \,\,{}^{n - 2}{C_5}$, then the value of $n$ will be