Course content

Introdution to mathematical logic and set theory. Number theory and modular arithmetic: Integers, primes, the Euclidean algorithm, linear congruences and systems. Fermat's little theorem, the Chinese remainder theorem and some applications. Sequences, recurrence relations, growth. Mathematical induction. Combinatorial counting methods with applications. An introduction to the theory of relations, graphs, and trees. Formal languages, grammars, and finite automata. Kleene's theorem.

Learning outcome

The cource is aimed at giving the student an introduction to central topics in discrete mathematics, such as modular aritmetic, counting methods, graph theory, formal languages and automat theory.

Learning methods and activities

Lectures, compulsory exercises, mid-semester examination. Portfolio assessment is the basis for the grade awarded in the course. This portfolio comprises a written final examination 80% and the semester assignment 20%. The results for the constituent parts are to be given in %-points, while the grade for the whole portfolio (course grade) is given by the letter grading system. The mid-semester examination only counts if it has a positive effect on the total assessment. Retake of examination may be given as an oral examination.

Compulsory assignments

• Exercises

Recommended previous knowledge

None.

Course materials

Will be announced at the start of the semester.

Credit reductions