ConceptMathematics
Combinatorial proof by double counting
An identity like ∑ k (n choose k) = n 2ⁿ⁻¹ can be proven by counting the same set of objects—choosing a subset with a distinguished element—in two different ways.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.