In this module, you will first learn the basics of formal logic. With that foundational knowledge, you will learn multiple techniques to write mathematical proof in order to prove a statement. You will gain insights into how to choose proof methods, including direct proofs, indirect proofs, trivial proofs, and vacuous proofs.

In this module, you will learn about more proof techniques, including proof by contradiction, existence proofs, and proof by cases. You will recognise some common fallacies in incorrect proofs. Following this, you will learn about mathematical induction and strong mathematical induction. You will gain insights into writing inductive proof for standard theorems and problems. You will learn about sequences and summations. You will also learn about arithmetic, geometric, and harmonic progressions and their corresponding series.

This module introduces you to sets and functions. You will get acquainted with Venn diagrams, the cardinality of a set, power sets, set operations, set identities, and computer representation of sets. You will learn about injective, surjective, and bijective functions.

This module introduces you to relations by illustrating n-ary relations, complementary relations, and relations on a set. You will learn about reflexive, symmetric, anti-symmetric, and transitive relations. You will also learn about functionality, composite relations, representing relations, closure of relations, and applications of relations in computer science. You will also learn about the countability and uncountability of sets.

In this module, you will learn about equivalence relations, equivalence classes, and partitions. You will gain insights into partial ordering, partial or total ordered sets, and the Hasse diagram. You will also learn about maximal and minimal elements, least upper bound (lub ) and greatest lower bounds (glb ), and lattice.

In this module, you will learn about counting techniques, including the pigeonhole principle, permutations and combinations, and the inclusion-exclusion principle. You will gain insights into combinatorics, a subfield of discrete mathematics that deals with arrangements of discrete objects with specific constraints and the number of distinct ways of making such arrangements.

In this module, you will learn about definitions of recursive functions. You will learn to use structural induction to prove statements that use recursive definitions. You will also learn about recurrence relations and explore some techniques to solve them.

This module introduces you to graphs, starting from real-world examples. Following this, you will learn about rigorous definitions of graphs and techniques to represent them. You will also gain insights into bipartite graphs and graph isomorphism.

In this module, you will learn about more advanced topics pertaining to graphs. You will learn about definitions of paths and connectivity. You will also learn about Euler and Hamilton paths, planar graphs, and graph colorings and their applications.

This module introduces you to the fundamentals of trees and spanning trees of a graph. You will learn about algorithms to identify minimum spanning trees in a graph. Following this, the module introduces you to the notions of basic algebraic structures such as groups, semi-groups, and rings.