← Go Back

MATH 135 - Combinatorial Mathematics

Course Description

Basic and advanced counting techniques; analysis of discrete mathematical structures and patterns

Course Learning Outcomes

After completion of the course, the student should be able to:

1. Discuss the fundamental concepts and techniques of combinatorics.
2. Apply appropriate combinatorial methods in analyzing discrete mathematical problems.
3. Construct combinatorial proofs of the main results and other propositions in combinatorial mathematics.
4. Engage in problem-solving using combinatorial principles and tools learned.

Course Outline

I. Basic Counting Principles

II. Binomial and Multinomial Coefficients

III. The Pigeonhole Principle

IV. Generating Functions

V. Recurrence Relations