is calld Vandermonde Identity. According to Wikipedia and some other CSDN blogs, I breifly summarize the way of proving this identity as follows:
The first version of proof is quite intuitive. We explain this identity as that there are n+m students in a class, and we want to pick k of them out. This intuition actually tells us that whenwe try to tackle some problems related to binomial coefficient, give it a vivid context, which will help us understand the problem better.
The second verion is more mathematical.