Catalog Entries |
Fall 2013
Apr 24,2024 |
|
 |
||
 | Select the Course Number to get further detail on the course. Select the desired Schedule Type to find available classes for the course. |
| MATH 290 - TOPICS: |
|
The descriptions and topics of this course change from semester-to-semester, as well as from instructor-to-instructor. Prerequisite: varies with the topic offered.
MATH 290 COMBINATORICS. This course is an introduction to the mathematics of examining discrete objects by counting them, constructing them, and finding algorithms to analyze them. Topics include enumeration techniques, permutations, combinations, pigeonhole principle, principle of inclusion-exclusion, generating functions, and recurrence relations as they naturally arise in graph theory, partition theory, group theory, probability, and games.
0.000 TO 4.000 Credit hours 0.000 TO 4.000 Lecture hours Levels: Undergraduate Schedule Types: Lecture Mathematics Department |
|