Advertisements
Advertisements
प्रश्न
For all positive integers n, show that 2nCn + 2nCn − 1 = `1/2` 2n + 2Cn+1
Advertisements
उत्तर
\[LHS = {}^{2n} C_n + {}^{2n} C_{n - 1} \]
\[ = \frac{\left( 2n \right)!}{n! n!} + \frac{\left( 2n \right)!}{\left( n - 1 \right)! \left( 2n - n + 1 \right)!}\]
\[ = \frac{\left( 2n \right)!}{n! n!} + \frac{\left( 2n \right)!}{\left( n - 1 \right)! \left( n + 1 \right)!}\]
\[ = \frac{\left( 2n \right)!}{n \left( n - 1 \right)! n!} + \frac{\left( 2n \right)!}{\left( n - 1 \right)! \left( n + 1 \right)n!}\]
\[ = \frac{\left( 2n \right)!}{n! \left( n - 1 \right)!} \left[ \frac{1}{n} + \frac{1}{n + 1} \right]\]
\[ = \frac{\left( 2n \right)!}{n! \left( n - 1 \right)!} \left[ \frac{2n + 1}{n \left( n + 1 \right)} \right]\]
\[ = \frac{\left( 2n + 1 \right)!}{n! \left( n + 1 \right)!}\]
\[RHS = \frac{1}{2} {}^{2n + 2} C_{n + 1} \]
\[ = \frac{1}{2} \left[ \frac{\left( 2n + 2 \right)!}{\left( n + 1 \right)! \left( 2n + 2 - n - 1 \right)!} \right]\]
\[ = \frac{1}{2} \left[ \frac{\left( 2n + 2 \right)!}{\left( n + 1 \right)! \left( n + 1 \right)!} \right]\]
\[ = \frac{1}{2} \left[ \frac{\left( 2n + 2 \right) \left( 2n + 1 \right)!}{\left( n + 1 \right) n! \left( n + 1 \right)!} \right]\]
\[ = \frac{1}{2} \left[ \frac{2\left( n + 1 \right) \left( 2n + 1 \right)!}{\left( n + 1 \right) n! \left( n + 1 \right)!} \right]\]
\[ = \frac{\left( 2n + 1 \right)!}{n! \left( n + 1 \right)!}\]
∴ LHS = RHS
APPEARS IN
संबंधित प्रश्न
Convert the following products into factorials:
5 · 6 · 7 · 8 · 9 · 10
Convert the following products into factorials:
(n + 1) (n + 2) (n + 3) ... (2n)
Prove that:
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 P(11, r) = P (12, r − 1) find r.
If P (n − 1, 3) : P (n, 4) = 1 : 9, 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 n +5Pn +1 =\[\frac{11 (n - 1)}{2}\]n +3Pn, find n.
In how many ways can five children stand in a queue?
Four letters E, K, S and V, one in each, were purchased from a plastic warehouse. How many ordered pairs of letters, to be used as initials, can be formed from them?
How many words, with or without meaning, can be formed by using all the letters of the word 'DELHI', using each letter exactly once?
How many words, with or without meaning, can be formed by using the letters of the word 'TRIANGLE'?
How many 3-digit numbers can be formed by using the digits 1 to 9 if no digit 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 'STRANGE' be arranged so that
the vowels never come together?
How many different words can be formed from the letters of the word 'GANESHPURI'? In how many of these words:
the vowels are always together?
How many permutations can be formed by the letters of the word, 'VOWELS', when
each word begins with O and ends with L?
Find the number of words formed by permuting all the letters of the following words:
RUSSIA
Find the number of words formed by permuting all the letters of the following words:
CONSTANTINOPLE
How many words can be formed with the letters of the word 'PARALLEL' so that all L's do not come together?
How many number of four digits can be formed with the digits 1, 3, 3, 0?
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?
In how many ways can the letters of the word ASSASSINATION be arranged so that all the S's are together?
Find the total number of permutations of the letters of the word 'INSTITUTE'.
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'.
Prove that the product of 2n consecutive negative integers is divisible by (2n)!
Let r and n be positive integers such that 1 ≤ r ≤ n. Then prove the following:
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?
Find the number of permutations of n distinct things taken r together, in which 3 particular things must occur together.
Write the number of diagonals of an n-sided polygon.
