TADI31 · 6 credits · Basic level (G1F) · Matematik, Tillämpad matematik
Discrete Mathematics
Active · next start HT 2026
54%
passed the latest ordinary exam
TEN1 · 13 Jan 2026 · 59 students
68%
passed the ordinary exams, all sittings over the last 5 years
TEN1 · 237 students
Unusually hard in 2025/26
54% passed the ordinary exam in 2025/26 (59 students), against 74% on average in earlier years (178 students).
Part of 1 programme
Exam
TEN1 A written examination
- 5
- 4
- 3
- U
Ordinary exams
68% passed · 237 students
- 54%59
- 54%52
- 74%42
- 87%39
- 82%45
Re-exams
50% passed · 106 students
- 44%9
- 56%25
- 43%7
- 67%24
- 44%9
- 10%10
- 17%6
- 25%8
- 100%8
- Pass the re-exam: 50% (106 students), compared with 68% (237 students) on the ordinary exam
- Get 4 or 5: 30% (343 students)
Show small sittings (3)
Sittings with fewer than 5 students, often credit transfers or special sittings. They are not part of any figure on this page.
- 100%1
- 100%1
- 100%2
Other modules
Partial exams, hand-ins and labs. They are not part of the figures at the top.
Hand-in or lab
UPG1 Hand-in-assignment
- G
Main rounds
100% passed · 240 students
- 100%60
- 100%48
- 100%43
- 100%43
- 100%46
Later rounds
No sittings with at least 5 students.
Show small sittings (3)
Sittings with fewer than 5 students, often credit transfers or special sittings. They are not part of any figure on this page.
- 100%1
- 100%1
- 100%1
About the course
Aim
The course will provide the conceptual framework and the methods used within discrete mathematics for applications in program development, theoretical computer science, database theory and digital technology. After completing the course, the student will:
- be able to perform proofs by induction and be able to solve basic problems in integer arithmetic such as Diophantine equations,
- be able to apply the formula language and operations of set theory and be able to structure, formulate and solve combinatorial problems,
- be well acquainted with definitions and basic properties of graphs, and be able to use these for problem solving,
- be familiar with the language of set logic and logical operations and be able to evaluate the validity of logical conclusions and be able to present solutions and use the formulaic language of mathematics correctly.
Content
1. Number theory; prime numbers, divisibility, Euclid's algorithm, Diophantine equations. Induction and recursion.
2. Sert theory with operations on sets, Venn diagrams and number counting. Combinatorics with permutations and combinations and the binomial theorem.
3. Graphs, trees, algorithms for least expensive networks, modeling and problem solving with graphs. Logic with connectives, truth value tables and methods for inference.
- Examiner
- Daniel Carlsson
- Scheduled hours
- 50 h
- Main field of study
- Matematik, Tillämpad matematik