Discrete Mathematics MAA 103 (Year 1) explores the world of discrete mathematics which is a fundamental concept in many different areas of science and advanced mathematics. After a short review of some basic concepts (functions, induction, cardinality) the course goes on the exploration of new topics (basic notions in number and groups theory, combinatorics, permutations). In a second part, we introduce probability theory, first on finite sets, and then on countable ones.
The lectures will cover chapters 7 and 8 of the textbook Mathematics: A Discrete Introduction (3rd Edition) by E. Scheinerman, and chapter 9 of the textbook Discrete Mathematics with Applications by Epp. The latter also contains broader applications concerning computer sciences.
Discrete Mathematics (MAA103) begins by introducing students to the central notions needed to pursue advanced mathematics, such as elementary logic (e.g. quantifiers, different methods of proof), sets, and functions. The second part of the course introduces students to combinatorics and probability (on finite sets). Course material is supplemented with examples and applications, such as graphical modeling and generating functions.
- Teaching coordinator: Carrance Ariane
- Teaching coordinator: Clarisse Valentin
- Teaching coordinator: De Bouard Anne
- Teaching coordinator: Fantini Lorenzo
- Teaching coordinator: Fernández Baranda Ana
- Teaching coordinator: Grenioux Louis
- Teaching coordinator: Kammerer Emmanuel
- Teaching coordinator: Liu Shanqing