IX1500 Discrete Mathematics 7.5 credits

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.

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.

• 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.

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

• 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.

Anders Västberg

• 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 about the course can be found on the Course web at the link below. Information on the Course web will later be moved to this site.

In this course, the EECS code of honor applies, see: http://www.kth.se/en/eecs/utbildning/hederskodex.