Lec 17 | MIT 6.042J Mathematics for Computer Science, Fall 2010
71,636 views
About this video
Hand-picked by a BrighterTube curator · found via Developer-Y/cs-video-coursesTeaches counting rules II: permutations, combinations, the binomial theorem and inclusion-exclusion. Tom Leighton and Marten van Dijk's 6.042J is the standard MIT course on discrete maths for computer scientists; topics follow the OCW syllabus because the upload titles carry only lecture numbers.
MIT 6.042J, lecture 17: Counting rules II: permutations, combinations, the binomial theorem and inclusion-exclusion.
Video by MIT OpenCourseWare, played through YouTube's embedded player.
Part of MIT 6.042J Mathematics for Computer Science, Fall 2010