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

Given that we need to prove ![]()
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.

