CMU Campus
Undergraduate Programs      
Undergraduate Home Admissions and Financial Aid Research Opportunities Other Opportunities Degree Programs Course Descriptions Current Courses Honors Program Applying to Graduate School After Graduation Math Links
Undergraduate Courses 21-228
Discrete Mathematics

Fall or Spring: 9 units

The techniques of discrete mathematics arise in every application of mathematics which is not purely continuous, for example in computer science, economics, and general problems of optimization. This course presents two of the fundamental areas of discrete mathematics, namely enumeration and graph theory. The contents of this course include: An introduction to enumeration: permutations, combinations, recurrence relations, and generating functions. Ramsey's Theorem. Graph theory: planar graphs, Euler's Theorem, graph coloring, matchings, networks, and trees. 3 hours lecture, 1 hour recitation. Prerequisite: 21-127.