Course Syllabus for

Discrete Mathematics
Diskret matematik

FMA091F, 7.5 credits

Valid from: Autumn 2013
Decided by: FN1/Anders Gustafsson
Date of establishment: 2013-11-15

General Information

Division: Mathematics
Course type: Course given jointly for second and third cycle
The course is also given at second-cycle level with course code: FMA091
Teaching language: Swedish


The aim of the course is to treat some basic parts of discrete mathematics, of importance in computer science, information theory, signal processing, physics and many other subjects in technology and science. The aim is also to develop the postgraduate students' ability to solve problems and to assimilate mathematical text. The course should also provide general mathematical education.


Knowledge and Understanding

For a passing grade the doctoral student must

Competences and Skills

For a passing grade the doctoral student must

Course Contents

Number theory: Divisibility. Prime numbers. The Euclidean algorithm. Diofantine equations. Modular arithmetic. Sets, functions and relations: Injective, surjective and bijective functions. Inverse function. Equivalence relations. Partial order relations. Combinatorics: The four cases of counting with or without repetition and with or without regard to order. Binomial coefficients. The principle of inclusion and exclusion. The method of generating functions. Graph theory: Terminology and basic concepts. Eulerian and Hamiltonian graphs. Planar graphs. Graph colouring.

Course Literature

Instruction Details

Types of instruction: Lectures, seminars, exercises

Examination Details

Examination format: Written exam
Grading scale: Failed, pass

Admission Details

Assumed prior knowledge: Elementary linear algebra and analysis (FMAA01/05 and FMA420).

Course Occasion Information

Contact and Other Information

Course coordinators:
Web page:

Complete view