TATA65 · 6 credits · Basic level (G1N) · Matematik, Tillämpad matematik
Discrete Mathematics
Active · next start HT 2026
53%
passed the latest ordinary exam
TEN1 · 27 Oct 2025 · 171 students
68%
passed the ordinary exams, all sittings over the last 5 years
TEN1 · 822 students
Unusually hard in 2025/26
53% passed the ordinary exam in 2025/26 (171 students), against 72% on average in earlier years (651 students).
Part of 2 programmes
Exam
TEN1 Written examination
- 5
- 4
- 3
- U
Ordinary exams
68% passed · 822 students
- 53%171
- 70%162
- 75%165
- 73%172
- 70%152
Re-exams
36% passed · 296 students
- 14%28
- 17%66
- 31%13
- 59%37
- 27%15
- 45%31
- 50%26
- 52%29
- 29%21
- 50%30
- Pass the re-exam: 36% (296 students), compared with 68% (822 students) on the ordinary exam
- Get 4 or 5: 27% (1,118 students)
Other modules
Partial exams, hand-ins and labs. They are not part of the figures at the top.
Hand-in or lab
UPG1 Assignments
- G
Main rounds
100% passed · 750 students
- 100%152
- 100%145
- 100%153
- 100%156
- 100%144
Later rounds
No sittings with at least 5 students.
Show small sittings (14)
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
- 100%1
- 100%1
- 100%1
- 100%1
- 100%1
- 100%1
- 100%1
- 100%1
- 100%2
- 100%1
- 100%2
About the course
Aim
The course will provide the conceptual framework and the techniques used within discrete mathematics for applications in program development, theoretical computer science, database theory, digital technology and which will be used in further studies in discrete mathematics. After completing the course, the student must:
- be able to perform proofs with induction, apply induction in solving recursive problems, and be able to solve basic problems in integer arithmetic such as Diophantine equations,
- have assimilated and been able to apply the formulaic language and operations of set theory, and thereby structure, formulate and solve combinatorial problems,
- be well acquainted with the definitions and basic properties of relations, graphs and Boolean functions, as well as related concepts described by the course content, and be able to use these for problem solving and simpler proofs,
- be able to present solutions and use the formulaic language of mathematics correctly.
Content
1. Induction and recursion. Number theory and congruence calculus. Euclid's algorithm and Diophantine equations.
2. Quantitative learning with operations, Venn diagrams and number counting. The binomial theorem. Combinatorics with permutations and combinations. The principle of inclusion and exclusion.
3. Relations. Partial orders and equivalence relations with partitions. Lattice. Graphs, trees, modeling and problem solving with graphs. Coloring of graphs. Chromatic numbers and polynomials. Boolean functions and Boolean algebra.
- Examiner
- Jonna Gill
- Scheduled hours
- 80 h
- Main field of study
- Matematik, Tillämpad matematik