# Tagged Questions

For questions about the study of finite or countable discrete structures, specifically how to count or enumerate elements in a set (perhaps of all possibilities) or any subset. It includes questions on permutations, combinations, bijective proofs, and generating functions.

719 views

### Prove $\sum_{i=0}^n\binom{i+k-1}{k-1}=\binom{n+k}{k}$ (a.k.a. Hockey-Stick Identity) [duplicate]

Let $n$ be a nonnegative integer, and $k$ a positive integer. Could someone explain to me why the identity $$\sum_{i=0}^n\binom{i+k-1}{k-1}=\binom{n+k}{k}$$ holds?
20k views

973 views

### extended stars-and-bars problem(where the upper limit of the variable is bounded)

The problem of counting the solutions $(a_1,a_2,\ldots,a_n)$ with integer $a_i\geq0$ for $i\in\{1,2,\ldots,n\}$ such that $$a_1+a_2+a_3+....a_n=N$$ can be solved with a stars-and-bars argument. What ...
### What does $\binom{-n}{k}$ mean?
For positive integers $n$ and $k$, what is the meaning of $\binom{-n}{k}$? Specifically, are there any combinatorial interpretations for it? Edit: I just came across Daniel Loeb, Sets with a ...