MATH 184Enumerative Combinatorics
Introduction to the theory and applications of combinatorics. Enumeration of combinatorial structures (permutations, integer partitions, set partitions). Bijections, inclusion-exclusion, ordinary and exponential generating functions. Renumbered from MATH 184A; credit not offered for MATH 184 if MATH 184A if previously taken. Credit not offered for MATH 184 if MATH 188 previously taken. If MATH 184 and MATH 188 are concurrently taken, credit only offered for MATH 188.
Prerequisites
From the catalog: “MATH 31CH or MATH 109. Students who have not completed listed prerequisites may enroll with consent of instructor.”
Where it sits in degree plans
One of the options in (3)
- Artificial Intelligence
- Computer Science (B.S.)
- Mathematics (Applied) (B.S.)
Courses that list MATH 184 as a prerequisite (9)
- CSE 100 Advanced Data Structures
- CSE 100R Advanced Data Structures
- CSE 101 Design and Analysis of Algorithms
- CSE 103 A Practical Introduction to Probability and Statistics
- CSE 105 Theory of Computability
- CSE 106 Discrete and Continuous Optimization
- CSE 107 Introduction to Modern Cryptography
- CSE 127 Introduction to Computer Security (4) Tags: Systems, Applications of Computing
- ECON 149 Introduction to Economic Design