Combinatorics

5 credits

Syllabus, Bachelor's level, 1MA020

A revised version of the syllabus is available.

Code: 1MA020
Education cycle: First cycle
Main field(s) of study and in-depth level: Mathematics G1F
Grading system: Pass with distinction (5), Pass with credit (4), Pass (3), Fail (U)
Finalised by: The Faculty Board of Science and Technology, 15 March 2007
Responsible department: Department of Mathematics

Entry requirements

Single Variable Calculus or Series and Ordinary Differential Equations; Linear Algebra and Geometry I

Learning outcomes

In order to pass the course (grade 3) 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. Classical probability theory.

Instruction

Lectures and problem solving sessions.

Assessment

Written examination at the end of the course. Moreover, compulsory assignments may be given during the course.