Course development and history
Select the semester and course offering above to get information from the correct course syllabus and course offering.
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
No information inserted
If the course is discontinued, students may request to be examined during the following two academic years.
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.
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.