N Noway New member Oct 27, 2010 #1 Prove that for any integers m and n with 0 m n, (from i=m to n) (n choose i)(i choose m) = 2^n-m (n choose m) using either induction or a combinatorial argument
Prove that for any integers m and n with 0 m n, (from i=m to n) (n choose i)(i choose m) = 2^n-m (n choose m) using either induction or a combinatorial argument
