MATH1010 · Theorem · Chapter 1 · 1. Functions, sequences and finite proof tools
Finite binomial theorem
2 steps of prerequisites below it
For a nonnegative integer n, (a + b)ⁿ is the finite sum of C(n, k) aⁿ⁻ᵏ bᵏ over k = 0, …, n, proved by induction with Pascal's identity.
Taught in
Uses
- Mathematical induction · used in an argument or worked solution, passage 1.2
- Binomial coefficient · used in its definition, passage 1.2
- Pascal's identity · used in its proof, proof step 1.2
Used by
Everything this builds on, earliest first · 3 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.
- Mathematical induction · 1.2
- Binomial coefficient · 1.2
- Pascal's identity · 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.