Enumerative Combinatorics

Lecture, three hours; discussion, one hour. Enforced requisites: courses 31A, 31B, 61, 115A. Designed for mathematics and physics students. Permutations and combinations, counting principles, recurrence relations, and generating functions. Application to asymptotic and probabilistic enumeration. P/NP or letter grading.

Review Summary

Clarity
N/A
Organization
N/A
Time
N/A
Overall
N/A

Course

Instructor
Xu, P.
Previously taught
24S

Previous Grades

Grade distributions not available.