I don't understand what you're asking. Please clarify.
Pascal's triangle - Wikipedia, the free encyclopedia
On binomial expressions
If you remember the explicit formula for the Bernuoulli number of index m...
... you can obtain...
... and you are able to verify the first identity...
For the second identity i need some more time...
Kind regards
Hi Andreas,
The key phrase in the problem statement is "combinatorial argument". In combinatorics, a "combinatorial argument" or "combinatorial proof" is one that is based on showing a one-to-one relationship between two sets; the two sets must then have the same number of elements. Or perhaps you might take one set and count its members in two different ways; this is also viewed as "combinatorial". The feeling among some mathematicians is that combinatorial proofs exhibit a higher level of understanding than those based on mere computation. (Personally, I have enough trouble finding the merely computational results without looking for additional complications...)
One way to look at your first example is to let E be the set {1,2,3,4,5}. 5! is the number of bijections from E to E. A function from E to E is a bijection if its range has exactly 5 elements.
Let's see if we can count the bijections another way.
is the number of functions from E to E without any restrictions.
is the number of functions from E to E which have at most 4 distinct elements in their range.
...
is the number of functions from E to E which have at most k distinct elements in their range, for k = 1,2,3,4.
So the RHS counts the bijections from E to E, and the LHS takes all the functions from E to E, breaks them out based on the number of elements in their range, and uses these counts to once again count the bijections. The reason for the alternating sum is that the set of all functions contains the set of functions with at most 4 elements in their range, which contains the set of elements with at most 3 elements in their range, etc.
The second example looks like a similar approach may work there also.