TADI03 · 4 credits · Basic level (G1X) · Matematik, Tillämpad matematik
Discrete Mathematics
Discontinued
No exam statistics yet
There is no exam sitting with at least 5 students in the last three academic years. New courses and project-only courses often have no statistics.
Part of 2 programmes
About the course
Aim
To give tha basic knowledge of discrete mathematics that is needed for further courses in mathematics, natural and computer science. After completing the course the student should be able to
- understand and use the terminology and laws of set theory
- formulate and solve combinatorial problems on combinations and permutations
- use the principle of mathematical induction to prove theorems and formulas
- use the Euclidean algorithm to solve Diophantine equations
- master the foundations of graph theory and use graphs as a tool to model real-life problems
Content
Set theory, the laws of set theory and Venn diagrams. Mathematical induction and recursion. Combinatorics with permutations and combinations. Number theory and logic. Graphs: Euler tours, trees and some applications in sports and communication networks.
- Examiner
- Armen Asratian
- Scheduled hours
- 42 h
- Main field of study
- Matematik, Tillämpad matematik