01204211/homework5 counting 2

This is part of 01204211-58

Due: 19 Oct 2015

H.1 How many anagrams can you make from the word INNOVATION?

H.2

H.3 (LPV-3.4.1) In how many ways can you distribute all $n$ pennies to $k$ children if each child is supposed to get at least 2?

H.4 (LPV-3.6.3) Prove the following identity:

${\binom {n}{0}}{\binom {m}{k}}+{\binom {n}{1}}{\binom {m}{k-1}}+\cdots +{\binom {n}{k-1}}{\binom {m}{1}}+{\binom {n}{k}}{\binom {m}{0}}={\binom {n+m}{k}}$