Discrete mathematics gets easier when you know how to approach proofs. Direct reasoning, induction, and contradiction each have specific steps that can be learned and practiced. Pairing these methods ...

The Department has a strong faculty working in various topics in discrete mathematics, especially algorithmic aspects. The interface between Theoretical Computer Science and Discrete Mathematics has ...

Introduces students to ideas and techniques from discrete mathematics that are widely used in science and engineering. Mathematical definitions and proofs are emphasized. Topics include formal logic ...

The Optimisation and Algorithms Group conducts research in discrete optimisation, algorithm design, and related areas of mathematics and theoretical computer science. Our work is primarily theoretical ...

When it comes to teaching math, a debate has persisted for decades: How, and to what degree, should algorithms be a focus of learning math? The step-by-step procedures are among the most debated ...

Combinatorics and discrete mathematics form a vibrant and expansive branch of modern mathematics, dedicated to the study of finite or countable structures and the methods used to count, classify, and ...