Mathematical Sciences

Lund University

Discrete Mathematics

Official Course Description


In discrete mathemtics one works on discrete sets. In such a set there is a shortest distance between different points. This is not the case for the sets that one usually considers in analysis and linear algebra.

The most common discrete sets are finite ones, or subsets of the integers, Z, or Z^n.

The course treats combinatorics -- how to efficiently calculate the number of possible choices under certain constraints, e.g. the number of possible poker hands that contain a straight flush--, number theory which is important in coding theory-- and recurrence equations.

Finished Sessions


Previous exams

2020-08-25 Exam Solutions
2020-06-02 Exam Solutions
2020-01-07 Exam Solutions
2019-12-19 Exam Solutions
2019-08-31 Exam Solutions
2019-06-01 Exam Solutions
2018-08-25 Exam Solutions
2018-05-29 Exam Solutions
2017-08-14 Exam Solutions
2017-05-30 Exam Solutions
2016-08-24 Exam Solutions
2016-06-01 Exam Solutions

Course Information

PHD Code: FMA091F
Level:Upper Basic Level
Language:English upon request



CEQ - Discrete Mathematics