Advertisements
Advertisements
प्रश्न
Convert the following products into factorials:
(n + 1) (n + 2) (n + 3) ... (2n)
Advertisements
उत्तर
\[\ \left( n + 1 \right)\left( n + 2 \right)\left( n + 3 \right) . . . \left( 2n \right) = \frac{\left( 1 \right)\left( 2 \right)\left( 3 \right) . . . \left( n \right)\left( n + 1 \right)\left( n + 2 \right)\left( n + 3 \right) . . . \left( 2n \right)}{\left( 1 \right)\left( 2 \right)\left( 3 \right) . . . \left( n \right)}\]
\[ = \frac{\left( 2n \right)}{n!}\]
APPEARS IN
संबंधित प्रश्न
If (n + 1)! = 90 [(n − 1)!], find n.
If P (9, r) = 3024, find r.
If P (n, 4) = 12 . P (n, 2), find n.
If P (n, 5) : P (n, 3) = 2 : 1, find n.
Prove that:1 . P (1, 1) + 2 . P (2, 2) + 3 . P (3, 3) + ... + n . P (n, n) = P (n + 1, n + 1) − 1.
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.
Find the number of different 4-letter words, with or without meanings, that can be formed from the letters of the word 'NUMBER'.
How many three-digit numbers are there, with distinct digits, with each digit odd?
How many 3-digit numbers can be formed by using the digits 1 to 9 if no digit is repeated?
How many 3-digit even number can be made using the digits 1, 2, 3, 4, 5, 6, 7, if no digits is repeated?
Find the number of 4-digit numbers that can be formed using the digits 1, 2, 3, 4, 5, if no digit is repeated? How many of these will be even?
How many words can be formed from the letters of the word 'SUNDAY'? How many of these begin with D?
How many different words can be formed from the letters of the word 'GANESHPURI'? In how many of these words:
the letter G always occupies the first place?
How many different words can be formed from the letters of the word 'GANESHPURI'? In how many of these words:
the letters P and I respectively occupy first and last place?
How many different words can be formed from the letters of the word 'GANESHPURI'? In how many of these words:
the vowels always occupy even places?
m men and n women are to be seated in a row so that no two women sit together. if m > n then show that the number of ways in which they can be seated as\[\frac{m! (m + 1)!}{(m - n + 1) !}\]
How many three letter words can be made using the letters of the word 'ORIENTAL'?
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:
CONSTANTINOPLE
Find the total number of arrangements of the letters in the expression a3 b2 c4 when written at full length.
How many numbers can be formed with the digits 1, 2, 3, 4, 3, 2, 1 so that the odd digits always occupy the odd places?
How many different signals can be made from 4 red, 2 white and 3 green flags by arranging all of them vertically on a flagstaff?
How many number of four digits can be formed with the digits 1, 3, 3, 0?
In how many ways can 4 red, 3 yellow and 2 green discs be arranged in a row if the discs of the same colour are indistinguishable?
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'.
For all positive integers n, show that 2nCn + 2nCn − 1 = `1/2` 2n + 2Cn+1
Evaluate
Let r and n be positive integers such that 1 ≤ r ≤ n. Then prove the following:
Let r and n be positive integers such that 1 ≤ r ≤ n. Then prove the following:
n · n − 1Cr − 1 = (n − r + 1) nCr − 1
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.
Find the number of permutations of n different things taken r at a time such that two specified things occur together?
Write the value of\[\sum^6_{r = 1} \ ^{56 - r}{}{C}_3 + \ ^ {50}{}{C}_4\]
Write the number of ways in which 5 red and 4 white balls can be drawn from a bag containing 10 red and 8 white balls.
