MATH1010 · Theorem · Chapter 1 · 1. Functions, sequences and finite proof tools
Pascal's identity
1 steps of prerequisites below it
For 1 ≤ k ≤ n, C(n, k − 1) + C(n, k) = C(n + 1, k), seen by splitting selections according to whether they contain one distinguished object.
Taught in
- 1.2 Induction and finite binomial tools · introduced
Uses
- Binomial coefficient · used in its definition, passage 1.2
The same idea in other courses
- Pascal's identity MATH1020
Used by
Everything this builds on, earliest first · 1 steps
Each step comes after its own prerequisites, so reading in this order never needs something you have not met. It is a reading order for these notes, not a diagnosis of what you know.
- Binomial coefficient · 1.2
Possible roots and a review route need your own answers on these points. None are recorded yet, so none are suggested.
Longest chain down to a starting point
Each step is used by the one above it, across courses where the notes link them. It ends at a point the notes define without another point.