All Questions
1 question
8
votes
2
answers
693
views
Seeking a combinatorial proof for a binomial identity
Let $n\geq m\geq0$ be two integers. The below binomial identity is provable by other means:
$$\sum_{j=0}^m(-1)^j\binom{n+1}j2^{m-j}
=\sum_{j=0}^m(-1)^j\binom{n-m+j}j.$$
QUESTION. Can you provide a ...