Solveeit Logo

Question

Question: How many words can be formed from the letters of the word ‘DAUGHTER’ so that (i) The vowels always...

How many words can be formed from the letters of the word ‘DAUGHTER’ so that
(i) The vowels always come together?
(ii) The vowels never come together?

Explanation

Solution

The word daughter has 88 letters in which 33 are vowels. For the vowels to always come together consider all the 33 vowels to be one letter (suppose V) then total letters become 66 which can be arranged in 6!6! ways and the vowels themselves in 3!3! ways.

Complete step-by-step answer:
Given word ‘DAUGHTER’ has 88 letters in which 33 are vowels and 5 are consonants. A, U, E are vowels and D, G, H, T, R are consonants.
(i)We have to find the total number of words formed when the vowels always come together.
Consider the three vowels A, U, E to be one letter V then total letters are D, G, H, T, R and V. So the number of letters becomes 66
So we can arrange these 66 letters in 6!6! ways. Since the letter V consists of three vowels, the vowels themselves can interchange with themselves. So the number of ways the 33vowels can be arranged is 3!3!
Then,
\Rightarrow The total number of words formed will be=number of ways the 66 letters can be arranged ×number of ways the 33 vowels can be arranged
On putting the given values we get,
\Rightarrow The total number of words formed=6!×3!6! \times 3!
We know n!=n×(n1)!×...3,2,1n! = n \times \left( {n - 1} \right)! \times ...3,2,1
\Rightarrow The total number of words formed=6×4×5×3×2×1×3×2×16 \times 4 \times 5 \times 3 \times 2 \times 1 \times 3 \times 2 \times 1
On multiplying all the numbers we get,
\Rightarrow The total number of words formed=24×5×6×624 \times 5 \times 6 \times 6
\Rightarrow The total number of words formed=120×36120 \times 36
\Rightarrow The total number of words formed=43204320
The number of words formed from ‘DAUGHTER’ such that all vowels are together is 43204320.

(ii)We have to find the number of words formed when no vowels are together.
Consider the following arrangement- _D_H_G_T_R
The spaces before the consonants are for the vowels so that no vowels come together. Since there are 55 consonants so they can be arranged in 5!5! ways.
There are 66 spaces given for 33 vowels. We know to select r things out of n things we write use the following formula-nCr{}^{\text{n}}{{\text{C}}_{\text{r}}}=n!r!nr!\dfrac{{n!}}{{r!n - r!}}
So to select 33 spaces of out 66 spaces =6C3{}^6{{\text{C}}_3}
And the three vowels can be arranged in these three spaces in 3!3! ways.
\Rightarrow The total number of words formed=6C3×3!×5!{}^6{{\text{C}}_3} \times 3! \times 5!
\Rightarrow The total number of words formed=6!3!63!×5!×3!\dfrac{{6!}}{{3!6 - 3!}} \times 5! \times 3!
\Rightarrow The total number of words formed=6!3!×5!\dfrac{{6!}}{{3!}} \times 5!
On simplifying we get-
\Rightarrow The total number of words formed=6×5×4×3!3!×5!\dfrac{{6 \times 5 \times 4 \times 3!}}{{3!}} \times 5!
\Rightarrow The total number of words formed=120×5×4×3×2×1120 \times 5 \times 4 \times 3 \times 2 \times 1
On multiplying we get,
\Rightarrow The total number of words formed=1440014400
The total number of words formed from ‘DAUGHTER’ such that no vowels are together is 1440014400.

Note: Combination is used when things are to be arranged but not necessarily in order. Permutation is a little different. In permutation, order is important. Permutation is given by-
nPr=n!nr!\Rightarrow {}^n{P_r} = \dfrac{{n!}}{{n - r!}} Where n=total number of things and r=no. of things to be selected.