## Discrete Mathematics

An introduction to the basic ideas and notations involved in describing sets and their functions will be given. This module helps students to formalise the idea of the size of a set and what it means to be finite, countably infinite or uncountably finite. For finite sets, it is said that one is bigger than another if it contains more elements. What about infinite sets? Are some infinite sets bigger than others? Students will develop the tools to answer these questions and other counting problems, such as those involving recurrence relations, e.g. the Fibonacci numbers.

The module will also consider the connections between objects, leading to the study of graphs and networks – collections of nodes joined by edges. There are many applications of this theory in designing or understanding properties of systems, such as the infrastructure powering the internet, social networks, the London Underground and the global ecosystem.