MATB35 Discrete Mathematics, 7.5 credits, is an alternative-compulsory course at upper basic level for a Bachelor of Science degree in mathematics. The course can also be taken as an stand-alone course or as part of a course package.

The course is given in English at half-study pace during the second half of the autumn semester.

This course is given jointly for students at the Faculty of Science (course code MATB35) and Faculty of Engineering (course code FMAB75) as well as for students enrolled in the Teacher Education Programme (course code ÄMAD04).

Course Content
The course treats:

Number theory: divisibility, prime numbers, the Euclidean algorithm, Chinese remainder theorem, modular arithmetic
Sets, functions and relations, equivalence relations
Combinatorics: the four cases of counting with or without repetition and with or without regard to order, binomial coefficients, the principle of inclusion and exclusion, the method of generating functions
Recursion: recursion formulae and difference equations
Rings and fields: definitions and applications to coding theory
Graph theory: terminology and basic concepts, Eulerian and Hamiltonian graphs.

Teaching
The teaching consists of lectures and seminars. An essential feature of the seminars is training in problem-solving. A compulsory programming assignment carried out in groups is part of the course.

Assessment
The course is assessed through a written examination and an oral examination at the end of the course and a group assignment during thecourse. The oral examination may only be taken by those students who have passed the written examination.

Course Literature

Ralph P. Grimaldi, Discrete and Combinatorial Mathematics, 5th ed., Addison-Wesley, 2013 ISBN: 978-1-2920-2279-6,
Karl-Gustav Andersson, Finite Fields and Error Correcting Codes, compendium, Lund University, 2015.

Official Course Description

Syllabus in English
Kursplan på svenska

Course Evaluation