Guichard-Combinatorics-Graph-Theory · Problem 1.3.2

Fundamentals

Mathematics — Probability · binomial-coefficients

Problem

Prove by induction that

\sum_{k=0}^{n} \binom{k}{i} = \binom{n+1}{i+1}

for

n \geq 0

and

i \geq 0