Question: combinatorics course but this is the calculus aspect ...need help with a step by step explanation (a) Prove by Induction on n, 3 + -
combinatorics course but this is the calculus aspect ...need help with a step by step explanation

(a) Prove by Induction on n, 3 + - + ... + 1 for n > k. (b) Hence prove by Induction on n, that the number of r-combinations atr-1 taken from n objects with repetitions allowed is [7] n - 1
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
