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.
AI is thinking…
Couldn't generate an explanation.
Generated by AI. May contain inaccuracies — always verify with your textbook.


