TITLE: Combinatorial Proof of ${n\choose{m}}=\frac{n}{m}{{n-1}\choose{m-1}}$
QUESTION [5 upvotes]: How do prove the following identity combinatorially?
$${n\choose{m}}=\frac{n}{m}{{n-1}\choose{m-1}}$$
Any help or hints would be great!

REPLY [9 votes]: Since selecting $m$ out of $n$ people and giving one of the selected a hat is the same as selecting one hat.bearer out of $n$ people and then picking $m-1$ from the remaining $n-1$ people, we have $m{n\choose m}=n{n-1\choose m-1}$.

REPLY [2 votes]: Hint:  Choose a committee of $m$ people among a total of $n$ people, then in the committee, we choose a chairman, for example.