Skip to content
Philoid
Browse Saved
Back to chapter
Maths
17. Combinations
Home · Class 11 · Maths · Ref. Book · 17. Combinations
Prev
Next
Q18 of 118 Page 18

Prove that : 4nC2n : 2nCn = [1 . 3 . 5 …. (4n – 1)] : [1.3.5….. (2n – 1)]2.

Given that we need to prove:


4nC2n : 2nCn = [1 . 3 . 5 …. (4n – 1)] : [1.3.5….. (2n – 1)]2.


Consider L.H.S:


We know that


And also n! = n(n – 1)(n – 2)…………2.1


⇒


⇒


⇒


⇒


⇒


⇒


⇒


⇒


⇒


⇒


⇒


= R.H.S


∴ L.H.S = R.H.S, thus proved.


More from this chapter

All 118 →
16

Prove that the product of 2n consecutive negative integers is divisible by (2n)!

17

For all positive integers n, show that

19

Evaluate

20

Let r and n be positive integers such that 1 ≤ r ≤ n. Then prove the following:

Questions · 118
17. Combinations
1 1 1 1 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 20 20 20 1 2 3 4 5 5 5 6 7 8 8 8 9 10 11 12 13 14 15 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 30 30 31 32 33 1 2 3 3 3 4 5 6 7 8 9 10 11 1 2 3 4 5 6 7 8 9 10 11 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27
Back to chapter
ADVERTISEMENT
About Contact Privacy Terms
Philoid · 2026
  • Home
  • Search
  • Browse
  • Quiz
  • Saved