Combinatorics
Syllabus, Bachelor's level, 1MA020
- 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
Higher grades, 4 or 5, require a higher level of proficiency. The student should be able to solve problems of greater complexity, i.e. problems requiring a combination of ideas and methods for their solution, and be able to give a more detailed account of the proofs of important theorems and by examples and counter-examples be able to motivate the scope of various results. Requirements concerning the student's ability to present mathematical arguments and reasoning are greater.
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.
Reading list
- Reading list valid from Autumn 2024, version 2
- Reading list valid from Autumn 2024, version 1
- Reading list valid from Autumn 2022
- Reading list valid from Autumn 2020
- Reading list valid from Autumn 2019
- Reading list valid from Spring 2019
- Reading list valid from Spring 2013
- Reading list valid from Spring 2010, version 2
- Reading list valid from Spring 2010, version 1
- Reading list valid from Autumn 2009
- Reading list valid from Autumn 2007, version 2
- Reading list valid from Autumn 2007, version 1