MA210 (Discrete Mathematics)
Contact
- Name: Domenico Mergoni
- Email: d.mergoni -at- lse.ac.uk
- Work: London School of Economics
Tip
Internet is a great resource. Use it. Some resources I like:
Course content (Official)
This is a course covering a number of concepts and techniques of discrete mathematics. Topics covered: Counting: selections; inclusion-exclusion; generating functions; recurrence relations. Graph Theory: basic concepts; walks, paths, tours and cycles; trees and forests; colourings. Coding theory: basic concepts; linear codes.
Material (Official and mine)
The following material should help the student preparing for this course. It contains both lecture notes, problem sets, and some solutions prepared by me.
Lecture Notes and Assignments
| Weeks Covered | Author | Link |
|---|---|---|
| 1-2 | Peter Allen | link |
| 3-4 | Peter Allen | link |
| 5-6 | Peter Allen | link |
| 7-8 | Peter Allen | link |
| 9-10 | Peter Allen | link |
My solutions
The text of the exercises is in the links above.
| Week | Solution |
|---|---|
| Week 1 | My solutions |
| Week 2 | My solutions |
| Week 3 | My solutions |
| Week 4 | My solutions |
| Week 5 | My solutions |
| Week 6 | My solutions |
| Week 7 | My solutions |
| Week 8 | My solutions |
| Week 9 | My solutions |