The previous talk in the series is here. The next talk in the series is here.
Combinatorics is full of estimates, and for many of them one needs bounds on factorials and binomial coefficients. Fortunately, one can often get away with fairly crude bounds that have straightforward proofs. Here I discuss some of these bounds.
This video was produced by Tim Gowers as part of his Part III course at the University of Cambridge. Printed notes for this course are available here.