# Prove discrete math identity C(n,r)⋅C(r,k) = C(n,k)⋅C(n-k,r-k)?

Prove the identity C(n,r)⋅C(r,k) = C(n,k)⋅C(n-k,r-k), whenever n, r, and k are nonnegative integers with r≤n and k≤r,

a) Using a combinatorial argument

b) using an argument based on the formula for the number of r-combinations of a set with n elements

It really has me stumped!

a) Using a combinatorial argument

b) using an argument based on the formula for the number of r-combinations of a set with n elements

It really has me stumped!

Follow

4 answers
4

Are you sure you want to delete this answer?