Prove the combinatorial identity

(a) by induction on i;

(b) by a backwards induction argument on i—that is, prove it first for i = n, then assume it for i = k and show that this implies that it is true for i = k −1.

Transcribed Image Text:

n n n (2-1)-(0)-(+)+ ("). < n in n