TheoremBase

Binomial Identities

The row sum, the alternating row sum, absorption, Vandermonde's identity, the hockey-stick identity and the weighted row sum for binomial coefficients.

Statement

In the setting of Finite Combinatorics: Notation, let m,n,k∈N0m,n,k\in\mathbb{N}_{0}.

Row sum.

∑j=0n(nj)=2n.\sum_{j=0}^{n}\binom{n}{j}=2^{n}.

Alternating row sum. In R\mathbb{R},

∑j=0n+1(−1)j(n+1j)=0.\sum_{j=0}^{n+1}(-1)^{j}\binom{n+1}{j}=0.

Absorption.

(k+1)(n+1k+1)=(n+1)(nk).(k+1)\binom{n+1}{k+1}=(n+1)\binom{n}{k}.

Vandermonde's identity.

∑j=0k(mj)(nk−j)=(m+nk).\sum_{j=0}^{k}\binom{m}{j}\binom{n}{k-j}=\binom{m+n}{k}.

Hockey-stick identity.

∑i=0n(ik)=(n+1k+1).\sum_{i=0}^{n}\binom{i}{k}=\binom{n+1}{k+1}.

Hockey-stick identity, shifted form.

∑s=0n(s+kk)=(n+k+1k+1).\sum_{s=0}^{n}\binom{s+k}{k}=\binom{n+k+1}{k+1}.

Weighted row sum.

∑j=0n+1j(n+1j)=(n+1) 2n.\sum_{j=0}^{n+1}j\binom{n+1}{j}=(n+1)\,2^{n}.

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…