Lesson 9 of 20 · about 14 min
The binomial theorem
Pascal's triangle holds every "n choose k" number, and each one is the sum of the two above it. You'll see why, use it to expand (a + b)ⁿ without multiplying everything out, and prove identities by counting the same thing in two ways.
🔓 Unlock this lesson
This lesson is part of the DoingCamp Pass. Members get every lesson in every course, with all the interactive visuals, coding exercises and challenges.
In this lesson you'll learn:
- Pascal's rule
- Binomial theorem
- Combinatorial proof
Free to try in F06 Discrete Math:
The first 3 lessons of every course are free, no account needed.