Inductive proof of kth falling power

228 Views Asked by At

I have been trying to prove the kth falling power

$$ \sum_{k=0}^{n}\binom{n}{k}x^{\underline{n-k}}y^{\underline{k}}= (x+y)^{\underline{n}} $$

However I can only prove it using a combinatorial proof. Really appreciate if someone could provide a inductive proof