Combinatorial identity
(n)(k) = (n)(n-m)
(k)(m) (m)(k-m)
How would i proof this by making a combinatorial argument using committees?
Printable View
Combinatorial identity
(n)(k) = (n)(n-m)
(k)(m) (m)(k-m)
How would i proof this by making a combinatorial argument using committees?