Discrete Mathematics 7.5 Credits

Diskret matematik
First cycle, M0009M
Course syllabus valid: Autumn 2018 Sp 1 - Present
The version indicates the term and period for which this course syllabus is valid. The most recent version of the course syllabus is shown first.

Syllabus established
The syllabus is valid from H07(Autumn 2007)

Last revised
by Mats Näsström 15 Feb 2018

Education level
First cycle
Grade scale
G U 3 4 5
Subject group (SCB)
Main field of study
Computer Science and Engineering

Entry requirements

In order to meet the general entry requirements for first cycle studies you must have successfully completed upper secondary education and documented skills in English language + Mathematics D (specifik entry 8). Or: Mathematics 3c (specifik entry A8)

More information about English language requirements


The selection is based on final school grades or Swedish Scholastic Aptitude Test.

Course Aim

Knowledge and understanding

  • be able to understand and in his or her own words clearly define the central concepts in combinatorics, logic, set theory, the theory of integers, functions and relations, graph theory, theory of automata, modular arithmetic and recurrence equations.
  • in his or her own words be able to describe the logical connection between occurring concepts.

 Competences and skills

  • be able to demonstrate ability to identify problems which can be solved with methods from the course and to choose the appropriate method.
  • be able to, in a well-structured way (logically coherent) solve and explain the solution to a problem within the course.
  • be able to integrate various parts from the course.

Combinatorics. Logic. Set theory including function and relations. Properties of integer numbers. Modular arithmetic. Theory of automata. Graphs and trees. Recurrence equations.

Lectures and tutorials.

Written exams.

Stefan Ericsson

Transition terms
The course M0009M is equal to MAM200

Literature. Valid from Autumn 2018 Sp 1 (May change until 10 weeks before course start)
Lecture notes and R.P. Grimaldi: Discrete and combinatorial mathematics. Addison-Wesley, latest edition.

Course offered by
Department of Engineering Sciences and Mathematics

0001Written exam7.5TG 6 U G VG 3 4 5

Study guidance
Study guidance for the course is to be found in our learning platform Canvas before the course starts. Students applying for single subject courses get more information in the Welcome letter. You will find the learning platform via My LTU.