ConceptMathematics
Binomial coefficient
The number of ways to choose k items from a set of n items, denoted as n choose k.
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.
Factorial5Natural numbers2Combinations1Combinatorics1Counting1Meruprastar1Pingal's Meruprastara1Set1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
6Each in their own terms, from the easiest level.
Vicky Neale
The number of ways of choosing things from things, defined as n!/((n - k)! k!).Manjul Bhargava
Coefficients of the binomial expansion that count combinations of items, corresponding to entries in Meruprastara or Pascal's triangle.Ankur Moitra
A value representing the number of ways to choose a subset of items from a larger set, specifically denoted as n choose k.Joe Blitzstein
The number of ways to choose a subset of size from a group of elements where order does not matter.Peter Shor
The number of ways to choose k things from n objects.
Lectures that assume it
10- Story Proofs, Axioms of Probability
- Theory of Generalization
- Counting Rules II
- The Hypercontractivity Theorem
- Transmitting Information Reliably over a Noisy Channel & Shannon’s Noisy Coding Theorem
- Random Processes and Quasirandomness for Decomposition Problems
- More Counting and Generating Functions
- Generating Functions for Catalan Numbers
- More on Generating Functions
- Structure of Neural Networks for Deep Learning
Connections
24The lectures that define it or assume it, and the concepts next to it.
Concepts7
- Factorial
- Natural numbers
- Binomial theorem
- Pascal's triangle
- Multinomial coefficient
- Stars and bars (combinatorics)
Show 1 moreShow fewer
Lectures17
- Poetry, Drumming, and Mathematics
- Binomial Theorem and Sets
- Binomial Coefficients Asymptotics
- Inclusion-Exclusion
- Probability and Counting
- Foundations of University Mathematics: From Calculation to Proof
Show 11 moreShow fewer
- Counting
- Story Proofs, Axioms of Probability
- Theory of Generalization
- Counting Rules II
- The Hypercontractivity Theorem
- Transmitting Information Reliably over a Noisy Channel & Shannon’s Noisy Coding Theorem
- Random Processes and Quasirandomness for Decomposition Problems
- More Counting and Generating Functions
- Generating Functions for Catalan Numbers
- More on Generating Functions
- Structure of Neural Networks for Deep Learning