Advertisements
Advertisements
प्रश्न
In how many ways can the letters of the word ASSASSINATION be arranged so that all the S's are together?
उत्तर
The word ASSASSINATION consists of 13 letters including three As, four Ss, two Ns and two Is.
Considering all the Ss are together or as a single letter, we are left with 10 letters. Out of these, there are three As, two Ns and two Is.
Number of words in which all the Ss are together = Permutations of 10 letters of which three are similar to the first kind, two are similar to the second kind and two are similar to the third kind =\[\frac{10!}{2!2!3!}\]= 151200
APPEARS IN
संबंधित प्रश्न
Prove that: n! (n + 2) = n! + (n + 1)!
If \[\frac{(2n)!}{3! (2n - 3)!}\] and \[\frac{n!}{2! (n - 2)!}\] are in the ratio 44 : 3, find n.
Prove that:
\[\frac{n!}{(n - r)! r!} + \frac{n!}{(n - r + 1)! (r - 1)!} = \frac{(n + 1)!}{r! (n - r + 1)!}\]
If nP4 = 360, find the value of n.
If n +5Pn +1 =\[\frac{11 (n - 1)}{2}\]n +3Pn, find n.
How many words, with or without meaning, can be formed by using all the letters of the word 'DELHI', using each letter exactly once?
There are two works each of 3 volumes and two works each of 2 volumes; In how many ways can the 10 books be placed on a shelf so that the volumes of the same work are not separated?
How many three-digit numbers are there, with no digit repeated?
In how many ways can 6 boys and 5 girls be arranged for a group photograph if the girls are to sit on chairs in a row and the boys are to stand in a row behind them?
If a denotes the number of permutations of (x + 2) things taken all at a time, b the number of permutations of x things taken 11 at a time and c the number of permutations of x − 11 things taken all at a time such that a = 182 bc, find the value of x.
How many 3-digit even number can be made using the digits 1, 2, 3, 4, 5, 6, 7, if no digits is repeated?
All the letters of the word 'EAMCOT' are arranged in different possible ways. Find the number of arrangements in which no two vowels are adjacent to each other.
In how many ways can the letters of the word 'FAILURE' be arranged so that the consonants may occupy only odd positions?
In how many ways can the letters of the word 'STRANGE' be arranged so that
the vowels come together?
In how many ways can the letters of the word 'STRANGE' be arranged so that
the vowels occupy only the odd places?
How many words can be formed from the letters of the word 'SUNDAY'? How many of these begin with D?
How many permutations can be formed by the letters of the word, 'VOWELS', when
there is no restriction on letters?
How many permutations can be formed by the letters of the word, 'VOWELS', when
each word begins with E?
In how many ways can a lawn tennis mixed double be made up from seven married couples if no husband and wife play in the same set?
How many words (with or without dictionary meaning) can be made from the letters in the word MONDAY, assuming that no letter is repeated, if all letters are used at a time.
Find the number of words formed by permuting all the letters of the following words:
ARRANGE
Find the number of words formed by permuting all the letters of the following words:
SERIES
How many words can be formed with the letters of the word 'UNIVERSITY', the vowels remaining together?
How many words can be formed by arranging the letters of the word 'MUMBAI' so that all M's come together?
How many different numbers, greater than 50000 can be formed with the digits 0, 1, 1, 5, 9.
Find the number of numbers, greater than a million, that can be formed with the digits 2, 3, 0, 3, 4, 2, 3.
How many numbers greater than 1000000 can be formed by using the digits 1, 2, 0, 2, 4, 2, 4?
Find the total number of permutations of the letters of the word 'INSTITUTE'.
In how many ways can the letters of the word "INTERMEDIATE" be arranged so that:
the relative order of vowels and consonants do not alter?
The letters of the word 'ZENITH' are written in all possible orders. How many words are possible if all these words are written out as in a dictionary? What is the rank of the word 'ZENITH'?
Prove that: 4nC2n : 2nCn = [1 · 3 · 5 ... (4n − 1)] : [1 · 3 · 5 ... (2n − 1)]2.
Evaluate
Let r and n be positive integers such that 1 ≤ r ≤ n. Then prove the following:
There are 10 persons named\[P_1 , P_2 , P_3 , . . . . , P_{10}\]
Out of 10 persons, 5 persons are to be arranged in a line such that in each arrangement P1 must occur whereas P4 and P5 do not occur. Find the number of such possible arrangements.
If 35Cn +7 = 35C4n − 2 , then write the values of n.
Write the number of diagonals of an n-sided polygon.
