Honors Concepts of Combinatorics (3) Honors version of elementary and enumerative combinatorics.
MATH 310H Honors Concepts of Combinatorics (3)
Math 310 introduces students to the fundamental techniques (i.e., addition, subtraction, multiplication, and division) and structures (i.e.,
permutations and combinations) of counting. An emphasis is placed on understanding the combinatorial interpretations of these objects and using
these interpretations to prove various identities (as opposed to using mathematical induction). By the end of the semester, the successful
student will be able to apply these methods to a complete set of distribution problems (distributing distinct/identical objects to distinct/identical boxes).
While Math 310H will introduce the student to the same fundamental techniques and structures, more of an emphasis will be placed on a variety
of different counting techniques. Students will be exposed to the principle of inclusion-exclusion, the transfer-matrix method, bijective proofs, and see a much more in-depth treatment of generating functions. The successful student will be able to apply these techniques to a much
broader spectrum of combinatorial problems than what is seen in Math 310.
General Education: None
Bachelor of Arts: Quantification
Effective: Spring 2012
Prerequisite: MATH 220
Note : Class size, frequency of offering, and evaluation methods will vary by location and instructor. For these details check the specific course syllabus.