Course webpage for

Discrete
Mathematics

spring 2019

5 april: Yesterday I showed some
computations in Maple. I you want an easily accessible introduction to using
Maple in discrete mathematics I can recommend Discrete
Math Labs developed by teachers at Shippensburg University. Using Maple is
not required in our course, but I think it can make it easier and more fun to
learn some aspects of discrete mathematics. As a student you can download Maple
for free. You can find more instructions here.

5 april: Why do we work in groups during
the exercise classes? There is research in mathematics education that shows a
number of benefits with learning mathematics in small groups. There are many
papers on this, but here is one
you can check out if you are interested. (To get the main points it is enough
to read the conclusions at page 12.) Also there is plenty of time for reading
and thinking on your own outside class, and I think most students benefit from
a combination of discussion and solitary work.

Welcome to
the course in Discrete Mathematics! The course will start with a lecture on
Monday 25 March at 13.15 in the Hörmander lecture
hall (formerly MH:C) in the mathematics building.

This is a
joint course for LTH (Faculty of Engineering) and Faculty of Science. If you
have questions about registration or such you should contact studerandeexpedition LTH or studerandeexpedition matematik NF
depending on which faculty you belong to.

If you have any questions about the course you can always
send me, Anna Torstensson, an email (annat at
maths.lth.se) and I’ll do my best to help you.

Course material

The course
program contains the most important information about the course: plan for
lectures, seminars and exercises etc. Times and venues are most easily found
using LTH
web schedule and NF
web schedule respectively.

We will be using the textbook:

Grimaldi,
Ralph: Discrete and Combinatorial Mathematics, An
Applied Introduction. Pearson, 2014, ISBN: 9781292022796.

Later in the course we will use some additional
material that you can download below:

Karl-Gustav Andersson, Finite Fields and Error-Correcting Codes, Lund
University (2015).

The Review
Questions helps you to test how well you know the course. The oral exam
will mostly consist of questions from this list.

Lecture Notes

Below are last years lecture notes. Some of them will be updated during
the course but there will not be any major changes.

Course Outline

Seminar presentation (from 2019)

Lecture 1(old) Lecture 2(old) Lecture 3(old) Lecture 4(old) Lecture 5(old) Lecture 6(old) Lecture 7(old) Lecture 8(old) Lecture 9(old) Lecture 10(old) Lecture 11(old) Lecture 12-13(old)