This lecture covers the distinct sums problem, polynomial approximation theorems, and independent events. It discusses the Weierstrass approximation theorem, defining independent events, and the goal of showing convergence for large n.
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.
The 'probabilistic method' is a fundamental tool in combinatorics. The basic idea is as follows: to prove that an object (for example, graph) with certain properties exists, it suffices to prove that
