New developments of an old identity
arXiv:1203.5424
Abstract
We give a direct combinatorial proof of a famous identity, by actually counting pairs of -subsets of -sets. Then we discuss two different generalizations of the identity, and end the paper by presenting in explicit form the ordinary generating function of the sequence $(\strut\binom{2n+k}{n})_{n\in\mathds{N}_0}$, where $k\in\mathds{R}$.
8 pages