Skip to main content

IX1500 Discrete Mathematics 7.5 credits


The course provides an introduction to discrete mathematics and its applications. The method of teaching is problem-oriented and with computer support. The course is divided into four sub-areas:

  1. Combinatorics and set theory
  2. integers
  3. relations and rings
  4. graph theory

The teaching consists of lectures, exercises and projects with presentation.

Choose semester and course offering

Choose semester and course offering to see current information and more about the course, such as course syllabus, study period, and application information.


For course offering

Autumn 2024 Start 26 Aug 2024 programme students

Application code


Headings with content from the Course syllabus IX1500 (Autumn 2021–) are denoted with an asterisk ( )

Content and learning outcomes

Course contents

Combinatorics, set theory and inclusion and exclusion, integer, divisibility, induction and recursion, functions and relations.

Introduction to groups, rings, bodies and the theorems of Fermat's and Euler's, the Chinese Remainder Theorem

Graph theory: isomorphic trees, walks and searches, Euler graphs, Hamilton graphs, planar graphs, colouring and chromatic number.

Intended learning outcomes

After passing the course, the student should be able to

  • formulate, analyse and solve problems in discrete mathematics that is of importance in the area of information and communication technology
  • apply and develop discrete models by means of a mathematical programming language
  • critically review and comment a given solution to a problem 
  • comment a discrete model and suggest improvements 
  • present solutions to given discrete problems both orally and in writing in a mathematically correct way.

Literature and preparations

Specific prerequisites

  • Knowledge in algebra and geometry, 7,5 credits, corresponding to completed course IX1303.
  • Knowledge and skills in problem-solving in mathematics, 7,5 credits, corresponding to completed course IX1307.

Active participation in a course offering where the final examination is not yet reported in Ladok is considered equivalent to completion of the course.

Registering for a course is counted as active participation.

The term 'final examination' encompasses both the regular examination and the first re-examination.

Recommended prerequisites

No information inserted


No information inserted


No information inserted

Examination and completion

If the course is discontinued, students may request to be examined during the following two academic years.

Grading scale

A, B, C, D, E, FX, F


  • INL1 - Problem Assignments, 4.0 credits, grading scale: A, B, C, D, E, FX, F
  • TEN1 - Examination, 3.5 credits, grading scale: A, B, C, D, E, FX, F

Based on recommendation from KTH’s coordinator for disabilities, the examiner will decide how to adapt an examination for students with documented disability.

The examiner may apply another examination format when re-examining individual students.

The examination is written.

Opportunity to complete the requirements via supplementary examination

No information inserted

Opportunity to raise an approved grade via renewed examination

No information inserted


Ethical approach

  • All members of a group are responsible for the group's work.
  • In any assessment, every student shall honestly disclose any help received and sources used.
  • In an oral assessment, every student shall be able to present and answer questions about the entire assignment and solution.

Further information

Course room in Canvas

Registered students find further information about the implementation of the course in the course room in Canvas. A link to the course room can be found under the tab Studies in the Personal menu at the start of the course.

Offered by

Main field of study

Mathematics, Technology

Education cycle

First cycle

Add-on studies

No information inserted

Supplementary information

In this course, the EECS code of honor applies, see: