18.200 Principles of Discrete Applied Mathematics
18.200 Principles of Discrete Applied Mathematics (Spring 2024, MIT OCW). Instructors: Prof. Ankur Moitra, Prof. Peter Shor, and Susan Ruff. This course will teach you illustrative topics in discrete applied mathematics, including counting, generating functions, probability, linear optimization, algebraic structures, basic number theory, information theory, and coding theory. It is a CI-M (Communication Intensive in the Major) course and thus includes a writing component. (from ocw.mit.edu)
| Lecture 05 - More Counting and Generating Functions |
We prove the Cayley tree theorem by counting in two ways. We then explain the basics of generating functions - what is a generating function, and how we combine two generating functions (e.g. adding them and multiplying them).
Go to the Course Home or watch other lectures: