prove that for every n>=k>=0, nCk + (n-1)Ck + (n-2)Ck + ............ + kCk = (n+1)C(k+1)

how can i solve it using combinatorial argument and not induction or algebric proof????

Printable View

- January 28th 2009, 08:48 AMtukilalacombinatorial argument
prove that for every n>=k>=0, nCk + (n-1)Ck + (n-2)Ck + ............ + kCk = (n+1)C(k+1)

how can i solve it using combinatorial argument and not induction or algebric proof???? - January 30th 2009, 01:03 PMPaulRS
See here