Mathematics: Discrete Mathematics

Education facts

Code: MATB35

<p>The course treats some basic parts of discrete mathematics of importance in mathematics, mathematical statistics, computer science and many other subject areas in science and technology.</p><p>The course treats:</p> <ul> <li>Number theory: divisibility, prime numbers, the Euclidean algorithm, Chinese remainder theorem, modular arithmetic</li> <li>Sets, functions and relations, equivalence relations</li> <li>Combinatorics: the four cases of counting with or without repetition and with or without regard to order, binomial coefficients, the principle of inclusion and exclusion, the method of generating functions</li> <li>Recursion: recursion formulae and difference equations</li> <li>Rings and fields: definitions and applications to coding theory</li> <li>Graph theory: terminology and basic concepts, Eulerian and Hamiltonian graphs.</li> </ul>

Entry requirements

Admission to the course requires knowledge corresponding to the courses MATA31 Analysis in One Variable, 15 credits, MATA32 Algebra and Vector Geometry, 7.5 credits, MATB32 Linear Algebra, 7.5 credits, and NUMA01 Computational Programming with Python , 7.5 credits.

Education offerings

Each offering has its own dates and conditions. Closed offerings are retained as history and do not mean that a new application is open.

• Mathematics: Discrete Mathematics

  Lund University

  Start date: 2 November 2026

  End date: 17 January 2027

  Pace of study: 50 %