ConceptTheory & Algos
Pascal's identity
Pascal's identity states that (n-1 choose k-1) + (n-1 choose k) = (n choose k), proved by partitioning the set of all -element subsets into those containing a specific element and those not containing it.
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
4The lectures that define it or assume it, and the concepts next to it.