Entry requirements

5 credits in mathematics. Participation in Single Variable Calculus or Single Variable Calculus M and in Linear Algebra I or Algebra and Geometry.

Learning outcomes

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

• give an account of basic combinatorial concepts and principles;
• use these to solve combinatorial problems;
• formulate important results and theorems covered by the course;
• describe the main features of the proofs of important theorems;
• present mathematical arguments to others.

Content

Fundamental enumeration principles. Permutations. Combinations. The Dirichlet box principle. Inclusion-exclusion. Recursion. Generating functions. Using combinatorics to solve simple problems in probability theory.

Instruction

Lectures and problem solving sessions. Problem solving with Python.

Assessment

Written examination at the end of the course and assignments during the course.

If there are special reasons for doing so, an examiner may make an exception from the method of assessment indicated and allow a student to be assessed by another method. An example of special reasons might be a certificate regarding special pedagogical support from the disability coordinator of the university.