MATH 3U03, Winter 2019
The subject of combinatorics is filled with questions which can be phrased easily, but are not so easy to answer. In large part, this course will be an exploration of some of the standard techniques of enumeration used in solving such problems. Other topics covered will include linear recurrence relations (like the Fibonacci sequence) and generating functions. These two topics will provide a glimpse into how techniques from linear algebra and calculus can be imported to answer seemingly unrelated combinatorial questions. While lectures, assignments, and tests will include proofs, a problem-solving style will dominate the course material. For the most part, reliance on previous mathematical ideas will be minimal. However, students will be expected to be familiar with basic calculus and linear algebra. Note: this course does not include graph theory, though a quick introduction to the subject may be given in the final lectures.
INSTRUCTOR: J. Hofscheier
3 Units Inversion formulae, systems of distinct representatives, block designs and other configurations; other topics.
Three lectures; one term
Prerequisite(s): One of MATH 2A03, 2X03 or ISCI 2A18 A/B; and MATH 2R03
Antirequisite(s): MATH 4C03