Advertisements
Advertisements
Question
There are three copies each of 4 different books. In how many ways can they be arranged in a shelf?
Advertisements
Solution
Total number of books = 12
∴ Required number of arrangements = Arrangements of 12 things of which each of the 4 different books has three copies =\[\frac{12!}{3!3!3!3!}\]=\[\frac{12!}{(3! )^4}\]
APPEARS IN
RELATED QUESTIONS
Convert the following products into factorials:
5 · 6 · 7 · 8 · 9 · 10
Convert the following products into factorials:
3 · 6 · 9 · 12 · 15 · 18
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 P (n, 5) = 20. P(n, 3), find n ?
If P(11, r) = P (12, r − 1) find r.
If P (2n − 1, n) : P (2n + 1, n − 1) = 22 : 7 find n.
If P (n, 5) : P (n, 3) = 2 : 1, find n.
If P (15, r − 1) : P (16, r − 2) = 3 : 4, find r.
If n +5Pn +1 =\[\frac{11 (n - 1)}{2}\]n +3Pn, find n.
In how many ways can five children stand in a queue?
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 numbers can be formed by using the digits 1 to 9 if no digit is repeated?
In how many ways can the letters of the word 'FAILURE' be arranged so that the consonants may occupy only odd positions?
How many words can be formed out of the letters of the word 'ARTICLE', so that vowels occupy even places?
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 4 letters are used at a time?
Find the number of words formed by permuting all the letters of the following words:
INDIA
Find the number of words formed by permuting all the letters of the following words:
EXERCISES
Find the total number of arrangements of the letters in the expression a3 b2 c4 when written at full length.
How many words can be formed by arranging the letters of the word 'MUMBAI' so that all M's come together?
In how many ways can the letters of the word 'ARRANGE' be arranged so that the two R's are never together?
How many words can be formed from the letters of the word 'SERIES' which start with S and end with S?
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 different arrangements can be made by using all the letters in the word 'MATHEMATICS'. How many of them begin with C? How many of them begin with T?
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'.
The letters of the word 'SURITI' are written in all possible orders and these words are written out as in a dictionary. Find the rank of the word 'SURITI'.
If the letters of the word 'MOTHER' are written in all possible orders and these words are written out as in a dictionary, find the rank of the word 'MOTHER'.
In how many ways can the letters of the word
"INTERMEDIATE" be arranged so that:the vowels always occupy even places?
For all positive integers n, show that 2nCn + 2nCn − 1 = `1/2` 2n + 2Cn+1
Prove that: 4nC2n : 2nCn = [1 · 3 · 5 ... (4n − 1)] : [1 · 3 · 5 ... (2n − 1)]2.
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.
How many words, with or without meaning can be formed from the letters of the word 'MONDAY', assuming that no letter is repeated, if all letters are used but first letter is a vowel?
How many words each of 3 vowels and 2 consonants can be formed from the letters of the word INVOLUTE?
Write the maximum number of points of intersection of 8 straight lines in a plane.
Write the number of ways in which 12 boys may be divided into three groups of 4 boys each.
