Online Course Discussion Forum
Homework II-A Combinatorics
I don't know how to do a combinatorial proof for questions 6.22 and 6.23, though I know the algebraic one. Does anybody know how to do them, especially 6.22?
The idea is to give two ways of counting the same thing, one that would yield the left side of the equation and the other the right side of the equation.
For example, on 6.22 we can think of choosing two disjoint groups of size $k$ and $j$ out of $n$ objects. As we can see on the left side of the equation, one way of counting is first choosing $k$ of the $n$ objects, and then choose $j$ of the remaining $n-k$ objects.
社交网络