Advertisements
Advertisements
Question
Prove that:
Advertisements
Solution
\[\text{LHS} = \frac{\left( 2n + 1 \right)!}{n!} \]
\[ = \frac{\left( 2n + 1 \right)\left( 2n \right)\left( 2n - 1 \right) . . . . \left( 4 \right)\left( 3 \right)\left( 2 \right)\left( 1 \right)}{n!}\]
\[ = \frac{\left[ \left( 1 \right)\left( 3 \right)\left( 5 \right) . . . . . . . . . \left( 2n - 1 \right)\left( 2n + 1 \right) \right]\left[ \left( 2 \right)\left( 4 \right)\left( 6 \right) . . . . . . . . . \left( 2n \right) \right]}{n!} \]
\[ = \frac{2^n \left[ \left( 1 \right)\left( 3 \right)\left( 5 \right) . . . . . . . . . \left( 2n - 1 \right)\left( 2n + 1 \right) \right]\left[ \left( 1 \right)\left( 2 \right)\left( 3 \right) . . . . . . . . . \left( n \right) \right]}{n!}\]
\[ = \frac{2^n \left[ \left( 1 \right)\left( 3 \right)\left( 5 \right) . . . . . . . . . \left( 2n - 1 \right)\left( 2n + 1 \right) \right]\left[ n! \right]}{n!}\]
\[ = 2^n \left[ \left( 1 \right)\left( 3 \right)\left( 5 \right) . . . . . . . . . \left( 2n - 1 \right)\left( 2n + 1 \right) \right] = \text{RHS}\]
\[ \text{Hence, proved} . \]
APPEARS IN
RELATED QUESTIONS
Convert the following products into factorials:
(n + 1) (n + 2) (n + 3) ... (2n)
Prove that: n! (n + 2) = n! + (n + 1)!
If (n + 2)! = 60 [(n − 1)!], find n.
Prove that:
If 5 P(4, n) = 6. P (5, n − 1), find n ?
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.
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.
How many three-digit numbers are there, with no digit 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?
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 permutations can be formed by the letters of the word, 'VOWELS', when
there is no restriction on letters?
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 but first is vowel.
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:
INDEPENDENCE
Find the number of words formed by permuting all the letters of the following words:
EXERCISES
Find the number of words formed by permuting all the letters of the following words:
CONSTANTINOPLE
In how many ways can the letters of the word 'ALGEBRA' be arranged without changing the relative order of the vowels and consonants?
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 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.
How many permutations of the letters of the word 'MADHUBANI' do not begin with M but end with I?
If the letters of the word 'LATE' be permuted and the words so formed be arranged as in a dictionary, find the rank of the word LATE.
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 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:
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 (i) 4 letters are used at a time
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 at a time
Find the number of permutations of n distinct things taken r together, in which 3 particular things must occur together.
Find the number of permutations of n different things taken r at a time such that two specified things occur together?
Write the maximum number of points of intersection of 8 straight lines in a plane.
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.
