Combinatorics and Graph Theory · Problem 1.3.4

Fundamentals — David Guichard

Mathematics — Combinatorics · binomial-coefficients

Problem

Use a combinatorial argument to prove that

\binom{k}{2} + \binom{n-k}{2} + k(n-k) = \binom{n}{2}