Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Lecture
Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers advanced counting techniques, including combinatorial proofs such as bijection and double counting. It explores the application of recurrence relations to solve counting problems, with examples on permutations and bit strings. The Generalized Pigeonhole Principle is discussed, along with Pascal's Identity and the Binomial Theorem.