Discrete Mathematics
Diskret matematik

FMA091F, 7.5 credits

Valid from: Autumn 2013
Decided by: FN1/Anders Gustafsson
Date of establishment: 2013-11-15

General Information

Division: Mathematics
Course type: Course given jointly for second and third cycle
The course is also given at second-cycle level with course code: FMA091
Teaching language: Swedish

Aim

The aim of the course is to treat some basic parts of discrete mathematics, of importance in computer science, information theory, signal processing, physics and many other subjects in technology and science. The aim is also to develop the postgraduate students' ability to solve problems and to assimilate mathematical text. The course should also provide general mathematical education.

Goals

Knowledge and Understanding

For a passing grade the doctoral student must

• be able to understand and in his or her own words clearly define the central concepts in combinatorics, number theory, functions and relations, and graph theory.
• in his or her own words be able to describe the logical connections between the occurring concepts (theorems and proofs).
• with confidence be able to carry out routine calculations within the framework of the course.
• in practical situations, with confidence be able to identify different combinatorial selections: with/without repetition, with/without regard to order.

Competences and Skills

For a passing grade the doctoral student must

• be able to demonstrate ability to identify problems which can be solved with methods from discrete mathematics and to choose an appropriate method.
• in connection with problem solving be able to demonstrate ability to integrate results from various parts of the course.
• be able to describe the connections between the different concepts in the course, in a well-structured, logically consistent manner and using proper terminology.
• with proper terminology, in a well-structured way and with clear logic be able to explain the solution to a problem.

Course Contents

Number theory: Divisibility. Prime numbers. The Euclidean algorithm. Diofantine equations. Modular arithmetic. Sets, functions and relations: Injective, surjective and bijective functions. Inverse function. Equivalence relations. Partial order 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. Graph theory: Terminology and basic concepts. Eulerian and Hamiltonian graphs. Planar graphs. Graph colouring.

Course Literature

• Böiers, L.: Diskret matematik. 2003. ISBN 9789144031026.
• Böiers, L.: Diskret matematik: Övningsbok. 2003. ISBN 9789144031194.

Instruction Details

Types of instruction: Lectures, seminars, exercises

Examination Details

Examination format: Written exam
Grading scale: Failed, pass
Examiner:

Admission Details

Assumed prior knowledge: Elementary linear algebra and analysis (FMAA01/05 and FMA420).

Course Occasion Information

Contact and Other Information

Course coordinators:
Web page: http://www.maths.lth.se/utbildning/matematiklth/