Learn · Principles of Discrete Applied Mathematics
Lecture 4 of 20Lecture Videos
Lecture 4: Counting
Prof. Ankur Moitra, Prof. Peter Shor and Susan Ruff · Massachusetts Institute of Technology
Credits and licence
- From
- Principles of Discrete Applied Mathematics, Massachusetts Institute of Technology (at MIT OpenCourseWare)
- Licence
- CC BY-NC-SA 4.0, as MIT OpenCourseWare states it. Non-commercial use only.
- Attribution
- Prof. Ankur Moitra, Prof. Peter Shor, Susan Ruff. Principles of Discrete Applied Mathematics. Spring 2024. Massachusetts Institute of Technology: MIT OpenCourseWare, https://ocw.mit.edu/. License: Creative Commons BY-NC-SA.
- Who can watch
- Teens profiles and older. How courses are placed
All the lectures
- Lecture 1: Pigeonhole Principle
- Lecture 2: Independence and Conditioning
- Lecture 3: Inclusion-Exclusion
- Lecture 4: Counting
- Lecture 5: More Counting and Generating Functions
- Lecture 6: More on Generating Functions
- Lecture 7: Generating Functions for Catalan Numbers
- Lecture 8: Tail Bounds
- Lecture 9: Chernoff Bounds
- Lecture 10: Modular Arithmetic
- Lecture 11: Basic Group Theory
- Lecture 12: Introduction to Linear Programming
- Lecture 13: Duality in Linear Programming
- Lecture 14: Zero-Sum Games
- Lecture 15: Max-Flow Min-Cut Theorem
- Lecture 16: Data Compression and Shannon’s Noiseless Coding Theorem
- Lecture 17: Huffman Coding
- Lecture 18: Transmitting Information Reliably over a Noisy Channel & Shannon’s Noisy Coding Theorem
- Lecture 19: Error-Correcting Codes—Hamming Codes
- Lecture 20: Reed-Solomon Codes