Question
Question: The number of permutations that can be made from the letters of the word \(OMEGA\) (i)with \(O\) a...
The number of permutations that can be made from the letters of the word OMEGA
(i)with O and A occupying end places be k
(ii)with E being always in the middle be m
(iii)with Vowels occupying odd places be n
(iv)with Vowels being never together be o
Find o−m−n−k/6.
Solution
We can see that the word OMEGA has 5 letters. There are 3 vowels O,E,A and 2 consonants that are M,G. Use the conditions to find the number of ways to arrange the letters according to the given conditions. The total number of words that can be formed is 5!.
Complete step-by-step answer:
(i) The number of permutations with O and A occupying end places be . So, it can be arranged as MEGOA.
As OA are fixed, the starting three letters MEG can be arranged in 3! ways.
The fixed letters OA can be arranged at their fixed places in 2! ways.
The number of permutations with O and A occupying end places is:
⇒k=3!×2!
⇒k=6×2
⇒k=12
(ii) The number of permutations with E being always in the middle be . So, it can be arranged as OMEGA.
As the letter A is fixed at the middle place, the letters O,M,G,A can be arranged in 4! ways. So,
⇒m=4!
⇒m=4×3×2
⇒m=24
(iii) The number of permutations with Vowels occupying odd places be . There are three vowels and three odd places (1st, 2nd, 3rd) in this arrangement.
The vowels O,E,A can be arranged in 3! ways.
The consonants M,G can be arranged in 2! ways. So,
⇒n=3!×2!
⇒n=6×2
⇒n=12
(iv) The number of permutations with Vowels never together be . The total number of words that can be formed is 5!.
Let us consider that all the vowels come together that is (O,E,A),M,G. The number of permutations when vowels come together is 3!×3!.
Now, the number of permutations with Vowels being never together can be calculated as:
⇒o=5!−3!×3!
⇒o=120−36
⇒o=84
Now, the required value of o−m−n−k/6 is:
⇒o−m−n−k/6=84−24−12−(12/2)
⇒o−m−n−k/6=48−6
⇒o−m−n−k/6=42
Therefore, the value of o−m−n−k/6 is 42.
Note: To find the number of permutations when some letters can never be arranged together, then find the number of permutations when letters can be arranged together and subtract it from the total number of permutations.