MATH0345A-S16
Combinatorics
Combinatorics
Combinatorics is the “art of counting.” Given a finite set of objects and a set of rules placed upon these objects, we will ask two questions. Does there exist an arrangement of the objects satisfying the rules? If so, how many are there? These are the questions of existence and enumeration. As such, we will study the following combinatorial objects and counting techniques: permutations, combinations, the generalized pigeonhole principle, binomial coefficients, the principle of inclusion-exclusion, recurrence relations, and some basic combinatorial designs. (MATH 0200 or by waiver) 3 hrs. lect./disc.
Combinatorics is the “art of counting.” Given a finite set of objects and a set of rules placed upon these objects, we will ask two questions. Does there exist an arrangement of the objects satisfying the rules? If so, how many are there? These are the questions of existence and enumeration. As such, we will study the following combinatorial objects and counting techniques: permutations, combinations, the generalized pigeonhole principle, binomial coefficients, the principle of inclusion-exclusion, recurrence relations, and some basic combinatorial designs. (MATH 0200 or by waiver) 3 hrs. lect./disc.
- Term:
- Spring 2016
- Location:
- Warner Hall 506(WNS 506)
- Schedule:
- 1:45pm-2:35pm on Monday, Wednesday, Friday (Feb 15, 2016 to May 16, 2016)
- Type:
- Lecture
- Instructors:
- Pete Schumer
- Subject:
- Mathematics
- Department:
- Mathematics
- Division:
- Natural Sciences
- Requirements Fulfilled:
- DED
- Levels:
- Undergraduate
- Availability:
- View availability, prerequisites, and other requirements.
- Course Reference Number (CRN):
- 21672
- Subject Code:
- MATH
- Course Number:
- 0345
- Section Identifier:
- A