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
Advanced Counting: Inclusion-Exclusion
Description
This lecture covers the Principle of Inclusion-Exclusion for finite sets, providing formulas and examples on how to count elements in unions and intersections. It also introduces the concept of derangements and presents the theorem for calculating the number of derangements in a set.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.