Mathematical Sciences

Lund University

Discrete Mathematics

Official Course Description

Description

In discrete mathemtics one works on discrete sets. In such a set there is a shortest distance between different points. This is not the case for the sets that one usually considers in analysis and linear algebra.

The most common discrete sets are finite ones, or subsets of the integers, Z, or Z^n.

The course treats combinatorics -- how to efficiently calculate the number of possible choices under certain constraints, e.g. the number of possible poker hands that contain a straight flush--, number theory which is important in coding theory-- and graph theory with important applications in e.g. economics and communication theory.

Finished Sessions

Examination


Previous exams

2013-08-23 Exam Solutions
2013-05-28 Exam Solutions
2013-01-07 Exam
2012-08-24 Exam Solutions
2012-05-24 Exam Solutions
2012-01-13 Exam
2011-08-19 Exam
2011-05-31 Exam Solutions
2011-01-07 Exam Solutions
2010-08-20 Exam Solutions
2010-05-26 Exam Solutions
2010-01-08 Exam Solutions

Course Information

LTH Code:FMA091
Credits:6.0
Level:Basic Level
Language:Swedish

Prerequisites

Following courses

CEQ

CEQ - Discrete Mathematics