Combinatorics and Graph Theory · Problem 1.3.2

Fundamentals — David Guichard

Mathematics — Combinatorics · binomial-coefficients

Problem

Prove by induction that ∑k=0n(ki)=(n+1i+1)\displaystyle\sum_{k=0}^{n} \binom{k}{i} = \binom{n+1}{i+1} for n≥0n \geq 0 and i≥0i \geq 0.

Related theory

Browse the problem library