Lecture 4: Counting

MIT OpenCourseWare · 78:26

This lecture derives binomial and multinomial coefficients, then uses double counting and bijections to prove that Dyck paths, plane trees, and binary trees are all counted by the Catalan numbers \(Cn = \frac{1}{n+1}\...

Read the full summary on tuber

Redirecting...