Mathematics 2T: Topics in Discrete Mathematics MATHS2025

  • Academic Session: 2023-24
  • School: School of Mathematics and Statistics
  • Credits: 10
  • Level: Level 2 (SCQF level 8)
  • Typically Offered: Semester 2
  • Available to Visiting Students: Yes

Short Description

This is a 21 lecture, 10 credit course covering important topics in discrete mathematics and combinatorics not currently covered in our honours programme and of potential interest to students studying Computer Science as well as Mathematics and Statistics.


2 x lectures per week. Fortnightly tutorials.

Requirements of Entry

Mathematics 1 (MATHS1017) at at least D3 or Mathematics 1G: Introduction to Algebra, Geometry & Networks (MATHS 1016) at at least D3.


One degree examination (80%) (1 hour 30 mins); coursework (20%).

Main Assessment In: April/May

Are reassessment opportunities available for all summative assessments? No

Reassessments are normally available for all courses, except those which contribute to the Honours classification. For non Honours courses, students are offered reassessment in all or any of the components of assessment if the satisfactory (threshold) grade for the overall course is not achieved at the first attempt. This is normally grade D3 for undergraduate students and grade C3 for postgraduate students. Exceptionally it may not be possible to offer reassessment of some coursework items, in which case the mark achieved at the first attempt will be counted towards the final course grade. Any such exceptions for this course are described below. 

Course Aims

Main aims are to introduce basic ideas, examples and applications related to the following topics: Enumeration Theory and Number theory and cryptography. Topics in Logic and Boolean algebras may also be covered as time permits.

Intended Learning Outcomes of Course

By the end of this course students will be able to:

■ write coherent statements of definitions and results covered in the course;

■ recognise situations in which it is appropriate to apply key theorems and algorithms from the course;

■ carry out simple computations in topics as described in the course aims;

■ illustrate concepts by the use of examples;

■ reproduce elementary proofs;

■ solve problems in topics described in the course aims, including both problems that are similar to problems recommended for coursework and formative assessment as well as unseen and more challenging problems.

Minimum Requirement for Award of Credits

Students must submit at least 75% by weight of the components (including examinations) of the course's summative assessment.