Course syllabus

Diskret matematik
Discrete Mathematics

FMAA15, 7,5 credits, G1 (First Cycle)

Valid for: 2014/15
Decided by: Education Board B
Date of Decision: 2014-04-08

General Information

Elective for: C4, D4-pv, E4, F1, Pi1
Language of instruction: The course will be given in 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 students' ability to solve problems and to assimilate mathematical text. The course should also provide general mathematical education.

Learning outcomes

Knowledge and understanding
For a passing grade the student must

Competences and skills
For a passing grade the student must


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.

Fields: Definition. Extensions of fields. Finite fields.


Examination details

Grading scale: TH
Assessment: Written test comprising theory and problems.


Required prior knowledge: Elementary linear algebra and analysis (FMAA01/05 and FMA420).
The number of participants is limited to: No
The course overlaps following course/s: FMA091, FMA661

Reading list

Contact and other information

Course coordinator: Anders Holst,