Identity using a combinatorial


Let n and k be integers with n ≥ k + 2 and k ≥ 2. Prove the following identity using a combinatorial proof:
(n choose k) = ((n - 2) choose k) + 2 . ((n - 2) choose(k - 1)) + ((n - 2) choose (k - 2)).

Request for Solution File

Ask an Expert for Answer!!
Basic Computer Science: Identity using a combinatorial
Reference No:- TGS0661451

Expected delivery within 24 Hours