Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
This lecture covers the proof and applications of the inclusion-exclusion formula in discrete mathematics. The formula is demonstrated through examples, including the computation of permutations without fixed points and Euler's totient function. The lecture also explores the hat-check girl problem and the probability of nobody receiving their own hat back.